Method and system for matching entities in an auction

ABSTRACT

A method for matching a first entity with at least one second entity selected from a plurality of second entities, comprising defining a plurality of multivalued scalar data representing inferential targeting parameters for the first entity and a plurality of multivalued scalar data of each of the plurality of second entities, representing respective characteristic parameters for each respective second entity; and performing an automated optimization with respect to an economic surplus of a respective match of the first entity with the at least one of the plurality of second entities, and an opportunity cost of the unavailability of the at least one of the plurality of second entities for matching with an alternate first entity.

CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 10/794,749, filed Mar. 5, 2004, now U.S. Pat. No. 7,676,034,which claims benefit of priority from U.S. Provisional PatentApplication 60/453,273, filed Mar. 7, 2003, each of which is expresslyincorporated herein by reference.

TECHNICAL FIELD

The present invention relates generally to computer integratedtelecommunications systems and more particularly to a system and methodemploying an intelligent switching architecture.

BACKGROUND OF THE INVENTION

The description of the invention herein is intended to provideinformation for one skilled in the art to understand and practice thefull scope of the invention, but is not intended to be limiting as tothe scope of available knowledge, nor admit that any particularreference, nor the combinations and analysis of this information aspresented herein, is itself a part of the prior art. It is, in fact, apart of the present invention to aggregate the below cited informationas a part of the disclosure, without limiting the scope thereof. All ofthe below-identified references are therefore expressly incorporatedherein by reference, as if the entirety thereof was recited completelyherein. It is particularly noted that the present invention is notlimited by a narrow or precise discussion herein, nor is it intendedthat any disclaimer, limitation, or mandatory language as applied to anyembodiment or embodiments be considered to limit the scope of theinvention as a whole. The scope of the invention is therefore to beconstrued as the entire literal scope of the claims, as well as anyequivalents thereof as provided by law. It is also understood that thetitle, abstract, field of the invention, and dependent claims are notintended to, and do not, limit the scope of the independent claims.

Real-time communications are typically handled by dedicated systemswhich assure that the management and control operations are handled in amanner to keep up with the communications process, and to avoid imposinginordinate delays. In order to provide cost-effective performance,complex processes incidental to the management or control of thecommunication are typically externalized. Thus, the communicationsprocess is generally unburdened from tasks requiring a high degree ofintelligence, for example the evaluation of complex algorithms and realtime optimizations. One possible exception is least cost routing (LCR),which seeks to employ a communications channel which is anticipated tohave a lowest cost per unit. In fact, LCR schemes, when implemented inconjunction with a communications switch, either employ simplepredetermined rules, or externalize the analysis.

Modern computer telephone integrated systems typically employ a generalpurpose computer with dedicated voice-communication hardwareperipherals, for example boards made by Dialogic, Inc. (Intel Corp.).The voice communication peripherals execute the low level processing andswitching of the voice channels, under control from the general purposeprocessor. Therefore, the voice-information is generally notcommunicated on the computer bus.

This architecture typically allows the computing platform to run amodern, non-deterministic operating system, such as Windows 2000,without impairing the real-time performance of the system as a whole,since the communications control functions are not as time critical asthe voice processing functions. However, as is well known,non-deterministic operating systems, such as Windows 2000, are subjectto significant latencies, especially when multiple tasks are executing,and when contention exists between resources, especially hard diskaccess and virtual memory. Therefore, in order to assure that systemoperation is unimpeded by inconsistent demands on the platform,typically the host computer system for the telephony peripherals is“dedicated”, and attempts are made to eliminate extraneous softwaretasks. On the other hand, externalizing essential functions imposespotential latencies due to communications and external processing.

The Call Center

A “call center” is an organization of people, telecommunicationsequipment and management software, with a mission of efficientlyhandling electronic customer contact. A typical call center must balancecompeting goals. Customers should experience high quality and consistentservice as measured, for example, by how long the customer's call mustwait in queue before being answered and receiving satisfactory service.At the same time, this service should be provided to make efficient useof call center resources.

Strategies for Call Center Management

“Workforce management” systems provide important tools for meeting thegoals of the call center. These systems generate forecasts of callvolumes and call handling times based on historical data, to predict howmuch staff will be needed at different times of the day and week. Thesystems then create schedules that match the staffing to anticipatedneeds.

Typically, an Automatic Call Distribution (ACD) function is provided inconjunction with a computerized Private Branch Exchange (PBX). This ACDfunction enables a group of agents, termed ACD agents, to handle a highvolume of inbound calls and simultaneously allows a queued caller tolisten to recordings when waiting for an available ACD agent. The ACDfunction typically informs inbound callers of their status while theywait and the ACD function routes callers to an appropriate ACD agent ona first-come-first-served basis.

Today, all full-featured PBXs provide the ACD function and there areeven vendors who provide switches specifically designed to support theACD function. The ACD function has been expanded to provide statisticalreporting tools, in addition to the call queuing and call routingfunctions mentioned above, which statistical reporting tools are used tomanage the call center. For example, ACD historical reports enable amanager to identify times: (a) when inbound callers abandon calls afterlong waits in a queue because, for example, the call center is staffedby too few ACD agents and (b) when many ACD agents are idle. Inaddition, ACD forecasting reports, based on the historical reports,allow the manager to determine appropriate staffing levels for specificweeks and months in the future.

Queue Management

ACD systems experience high traffic periods and low traffic periods.Consequently, ACD systems must be capable of automating two majordecisions. The first major decision may be referred to as the “agentselection decision,” i.e., when more than one agent is available tohandle the next transaction, which agent should be chosen? The secondmajor decision may be referred to as the “transaction selectiondecision,” i.e., when more than one transaction is waiting for the nextavailable agent and an agent becomes available, which transaction shouldthe agent handle?

One approach to the agent selection decision is to set up a sequencingscheme, so that the switch of the ACD system follows the same sequenceof agents until the first available agent in the sequence is found. Theconcern with this approach is that it creates “hot seats,” i.e. aninequitable distribution of inbound calls to ACD agents who are high inthe sequence. Most current ACD systems solve the agent selectiondecision by using a longest-idle-eligible-agent approach to provide amore equitable distribution of transactions.

There are also different approaches to the transaction selectiondecision in which there are more available transactions than there areACD agents. One approach is to create one or more first-in, first-out(FIFO) queues. Under this approach, each transaction may be marked witha priority level by the switch of the ACD system. When an agent becomesavailable, the transaction with the highest priority is routed to theagent. If several calls of equal priority are waiting in a queue, thecall which has been waiting the longest is routed to the availableagent. If the call center conducts outbound transactions, eachtransaction is similarly submitted to a FIFO queue with a prioritydesignation, with the switch routing transactions from the queue to theagents.

Queue/Team Management

Calls that arrive at a call center generally are classified into “calltypes” based on the dialed number and possibly other information such ascalling number or caller responses to prompts from the network. The callcenter is typically served by an automatic call distributor (ACD), whichidentifies the call type of each incoming call and either delivers orqueues it. Each call type may have a separate first-in-first-out queuein the ACD. In most existing call centers, the agents answering callsare organized into one or more “teams,” with each team having primaryresponsibility of the calls in one or more queues. This paradigm issometimes referred to as “queue/team.”

In the queue/team model, scheduling for each team can be doneindependently. Suppose, for example, that the call center handles callsfor sales, service, and billing, and that each of these call types isserved by a separate team. The schedule for sales agents will depend onthe forecast for sales call volume and on various constraints andpreferences applicable to the agents being scheduled, but this scheduleis not affected by the call volume forecast for service or billing.Further, within the sales team, agents are typically consideredinterchangeable from a call handling viewpoint. Thus, within a team,schedule start times, break times and the like, may be traded freelyamong agents in the team to satisfy agent preferences without affectingscheduled call coverage. See, U.S. Pat. No. 5,325,292, expresslyincorporated herein by reference.

In a queue/team environment, when a new call arrived, the ACD determinesthe call type and places it in the queue, if all agents are busy, orallocates this call to the team member who had been available thelongest.

Skill-based Routing

Skill-based routing of agents is a well known principle, in which theagent with the best match of skills to the problem presented is selectedfor handling the matter. Typically, these matters involve handling oftelephone calls in a call center, and the technology may be applied toboth inbound and outbound calling, or a combination of each. Theskill-based routing algorithms may also be used to anticipate callcenter needs, and therefore be used to optimally schedule agents forgreatest efficiency, lowest cost, or other optimized variable.

In the case of multi-skill criteria, the optimality of selection may bebased on a global minimization of the cost function or the like.

The longest-idle-agent approach and the FIFO approach function well inapplications having little variation in the types of transactions beinghandled by the ACD agents. If all agents can handle any transaction,these approaches provide a sufficiently high level of transactionalthroughput, i.e., the number of transactions handled by the call centerin a particular time interval. However, in many call centerenvironments, the agents are not equally adept at performing all typesof transactions. For example, some transactions of a particular callcenter may require knowledge of a language other than the nativelanguage of the country in which the call center is located. As anotherexample, some transactions may require the expertise of “specialists”having training in the specific field to which the transaction relates,since training all agents to be knowledgeable in all areas would becost-prohibitive. For ACD applications in which agents are not equallyadept at performing all transactions, there are a number of problemswhich at least potentially reduce transactional throughput of the callcenter. Three such problems may be referred to as the “under-skilledagent” problem, the “over-skilled agent” problem, and the “staticgrouping” problem.

The under-skilled agent problem reduces transactional throughput whenthe switch routes transactions to ACD agents who do not have sufficientskills to handle the transactions. For example, a call may be routed toan English-only speaking person, even though the caller only speaksSpanish. In another example, the transaction may relate to productsupport of a particular item for which the agent is not trained. Whenthis occurs, the agent will typically apologize to the customer andtransfer the call to another agent who is capable of helping thecustomer. Consequently, neither the agent's nor the customer's time isefficiently utilized.

Inefficient utilization is also a concern related to the over-skilledagent problem. A call center may have fixed groupings of agents, witheach group having highly trained individuals and less-experiencedindividuals. Call-management may also designate certain agents as“specialists,” since it would be cost prohibitive to train all agents tobe experts in all transactions. Ideally, the highly skilled agentshandle only those transactions that require a greater-than-average skilllevel. However, if a significant time passes without transactions thatrequire highly skilled agents, the agents may be assigned to calls forwhich they are over-qualified. This places the system in a position inwhich there is no qualified agent for an incoming call requiring aparticular expertise because the agents having the expertise arehandling calls that do not require such expertise. Again, thetransactional throughput of the call center is reduced.

Current ACD systems allow agents to be grouped according to training.For example, a product support call center may be divided into fourfixed, i.e., “static,” groups, with each group being trained in adifferent category of products sold by the company. There are a numberof potentially negative effects of static grouping. Firstly, the callcenter management must devise some configuration of agents into groups.This may be a costly process requiring extensive analysis and dataentry. Secondly, the configuration that is devised is not likely to beoptimal in all situations. The pace and mix of transactions will changeduring a typical day. At different times, the adverse effects of theunder-skilled agent problem and the adverse effects of the over-skilledagent problem will vary with respect to the transactional throughput ofthe call center. Thirdly, when a new product is released, the devisedconfiguration likely will be less valuable. In response to changes inthe size, pace and mix of the transaction load over the course of time,call management must monitor and adjust the performance of the currentgrouping configuration on an ongoing basis. When trends are detected,the grouping configuration should be changed. This requires the time andattention of call center managers and supervisors. Again, thetransactional throughput is reduced.

It is thus known in the prior art to provide ACD systems that departfrom the queue/team model described above. Calls are still categorizedinto call types. In place of queues for the call types, however, queuesassociated with “skills” are provided. The ACD's call distribution logicfor the call type determines which queue or queues a call will occupy atvarious times before it is answered. Agents are not organized into teamswith exclusive responsibility for specific queues. Instead, each agenthas one or more identified “skills” corresponding to the skills-basedqueues. Thus, both a given call and a given agent may be connected tomultiple queues at the same time. Agent skills designations may befurther qualified, for example, as “primary” or “secondary” skills, orwith some other designation of skill priority or degree of skillattainment. The ACD call distribution logic may take the skill prioritylevels into account in its call distribution logic.

In a skills-based routing environment, the “matching” of calls to agentsby the ACD becomes more sophisticated and thus complicated. Agents whohave more than one skill no longer “belong” to a well-defined team thathandles a restricted set of calls. Instead, the skills definitions form“implicit” teams that overlap in complex ways. If, for example, a callcenter has 10 skills defined, then agents could in principle have any of1024 possible combinations (2¹⁰) of those skills. Each skill combinationcould be eligible to handle a different subset of the incoming calls,and the eligible subset might vary with time of day, number of calls inqueue, or other factors used by the ACD in its call routing decisions.

Today, call center managers want to connect a caller to an ACD agenthaving exactly the right skills to serve the caller. However, “skillsbased” ACD agent groups are of ten small and, as a result, whenever aninbound call arrives, all such “skills based” ACD agents may be busy. Insuch instances, the ACD function can take call back instructions fromthe caller and the ACD function can manage the call back functions, forexample, by assigning such calls, in accordance with the callerinstructions, to a “skills based” ACD agent whenever one becomesavailable.

Scheduling of agents in a skills-based environment is thus a much moredifficult problem than it is in a queue/team environment. In askills-based environment, call types cannot be considered in isolation.Thus, for example, a heavy volume of Service calls might place higherdemands on multi-skilled agents, causing an unforeseen shortage ofcoverage for Billing calls. Further, agents with different skills cannotbe considered interchangeable for call handling. Thus, trading lunchtimes between a Sales-only agent and a multi-skill agent might lead toover-staffing Sales at noon while under-staffing Service at 1:00 p.m.This would lead to undesirable results. Moreover, with respect to theneeds of a particular call type, a multi-skilled agent might provide nohelp over a given span of time, might be 100% available for calls ofthat type, or might be available part of the time and handling othercall types for another part of time.

All agents having a particular combination of skills may be deemed a“skill group.” A central problem of skills-based scheduling is thenfinding a way to predict what fraction of scheduled agents from eachskill group will be available to each call type during each timeinterval being scheduled. If these fractions are known, then the effectof different agent schedules can be generated. Unfortunately, it isdifficult or impossible to calculate the skill group availabilityfractions directly. These functions depend on the relative and absolutecall volumes in each call type, on the particulars of the skills-basedcall distribution algorithms in the ACD, and on the skills profiles ofthe total scheduled agent population. Particularly as ACD skills-basedrouting algorithms themselves evolve and become more sophisticated, thefactors affecting skill group availability become too complex for directanalysis. One proposed solution provides a feedback mechanism involvingcall handling simulation and incremental scheduling, to schedule agentsin a skills-based routing environment. See, U.S. Pat. No. 6,044,355,expressly incorporated herein in its entirety.

In accordance with this “skills-based scheduling” method, a computerimplemented tool is used to determine an optimum schedule for aplurality of scheduled agents in a telephone call center, each of theplurality of scheduled agents having a combination of defined skills.The plurality of scheduled agents are organized into “skill groups” witheach group including all scheduled agents having a particularcombination of skills. The method begins by generating a plurality ofnet staffing arrays, each net staff array associated with a given calltype and defining, for each time interval to be scheduled, an estimateof a difference between a given staffing level and a staffing levelneeded to meet a current call handling requirement. In addition to thenet staffing arrays, the method uses a plurality of skills groupavailability arrays, each skills group availability array associatedwith the given call type and defining, for each combination of skillgroup and time interval to be scheduled, an estimate of a percentage ofscheduled agents from each skill group that are available to handle acall. According to the method, the plurality of arrays are used togenerate a proposed schedule for each of the plurality of scheduledagents. Thereafter, a call handling simulation is then run against theproposed schedule using a plurality of ACD call distribution algorithms(one for each call type being scheduled). Based on the results of thecall handling simulation, the net staffing arrays and the skillsavailability arrays are refined to more accurately define the netstaffing and skills usage requirements. The process of generating aschedule and then testing that schedule through the simulator is thenrepeated until a given event occurs. The given event may be adetermination that the schedule meets some given acceptance criteria, apassage of a predetermined period of time, a predetermined number ofiterations of the process, or some combination thereof. A proposedschedule is “optimized” when it provides an acceptable call handlingperformance level and an acceptable staffing level in the simulation.Once the proposed schedule is “optimized,” it may be further adjusted(within a particular skill group) to accommodate agent preferences.

U.S. Pat. No. 5,206,903 to Kohler et al. describes ACD equipment whichuses static grouping. Each static group of agents is referred to as a“split,” and each split is associated with a different queue. The agentsare assigned to splits according to skills. Within a single split, theagents may be limited to knowledge of different subtypes oftransactions. Preferably, there is at least one agent in each split whois trained to handle calls of any of the subtypes within the particularsplit. This “expert” may also be trained to efficiently handle calls ofother types, i.e., other splits. Each agent possesses up to four skillnumbers that represent various abilities of the agent with respect tohandling transactions related to subtypes and types of transactions. TheACD equipment assigns each incoming call three prioritized skill numbersthat estimate skill requirements of the incoming call. The skill numbersof the incoming call are considered “prioritized,” since they are viewedsequentially in searching for a match of the call with an agent, so thatthe second skill number of the call is unnecessary if a match is foundusing the first prioritized skill number. The incoming call is assignedthe one, two or three prioritized skill numbers and is placed in theappropriate queue of the appropriate static group of agents. A search ismade among the available agents for an agent-skill number that matchesthe first skill number of the call. If no match is found after apredetermined time delay, the second prioritized skill number of thecall is used to find a match. If no match is found after a secondpredetermined time delay, the third prioritized skill number isconsidered. Then, if no match is still found, the ACD equipment ofKohler et al. expands the search of available agents to other groups ofagents.

While the Kohler et al. patent does not directly address the problemsassociated with static groups, it does consider the skills of theindividual agents. The prioritized skill numbers assigned to theincoming calls are logically ordered. The patent refers to the firstskill number of a call as the primary call-skill indicator. This primaryindicator is used to define the minimal skill level that is required foran agent to competently handle the call. Consequently, if a match ismade with the primary indicator, the ACD agent may not be over-skilledor under-skilled. However, if the search is unsuccessful, the secondarycall-skill indicator is utilized. The search for a match to thesecondary indicator may cause the call to be routed to an agent havingmore than the minimal required skill. The third prioritized skill numberthat is assigned to the incoming call is referred to as the “tertiary”call-skill indicator. The tertiary indicator is yet another skill levelbeyond what is minimally required to competently handle a call. Sincethe tertiary indicator is utilized only if a match is not found foreither of the primary or secondary indicators, an overly skilled agentof the appropriate group will handle the call only if that agent is theonly available capable agent. Thus, more highly skilled agents areassigned only when their skills are required, or no lesser-skilled agentis available to handle the call.

See, U.S. Pat. Nos. 6,529,870; 6,522,726; 6,519,459; 6,519,259;6,510,221; 6,496,568; 6,493,696; 6,493,432; 6,487,533; 6,477,494;6,477,245; 6,470,077; 6,466,909; 6,466,654; 6,463,299; 6,459,784;6,453,038; and 2003/0002646.

Group Rating

Various types of conventional automatic distributors (ACDs) areavailable to distribute incoming calls to a group. Reservation andinformation services may be provided by large companies, such as majorairlines, and may consist of geographically separated groups of agentsthat answer incoming calls distributed to the agents by separate ACDs.Agent communication terminals (ACTs) which are connected to an ACD areutilized by the agents to process incoming calls routed to a particularACT by the ACD.

A public branch exchange (PBX) type ACD such as a Definity® ACDavailable from AT&T functions as a conventional PBX and furtherfunctions as an ACD to distribute incoming calls to local agentsconnected to the PBX. Another type of ACD consists of the utilization ofan electronic telecommunication switch such as a 5ESS® switch availablefrom AT&T which is capable of providing ACD service when supposed byACTs coupled to the switch. Both types of ACD typically function asindependent systems which handle incoming calls and make internaldecisions concerning which agent will receive a given call. Both typesof ACD systems are capable of generating statistical reports which canbe monitored by a workstation coupled to the ACD system to allow asupervisor to monitor call handling statistics. Such data typicallyrepresents an average of statistics for a given system.

Telephone call centers that handle calls to toll-free “800” numbers arewell-known in the art. Typically, a company may have many call centers,all answering calls made to the same set of 800 numbers. Each of thecompany's call centers usually has an automatic call distributor (ACD)or similar equipment capable of queuing calls. ACD managementinformation systems keep statistics on agent and call status, and canreport these statistics on frequent intervals. Such capabilities are inuse today for centralized reporting and display of multi-location callcenter status.

In such systems, the company will want to distribute the calls to itscall centers in a way that will optimally meet its business goals. Thosegoals might include low cost of call handling, answering most callswithin a given amount of time, providing customized handling for certaincalls, and many others. It is also known in the prior art that certaincall routing criteria and techniques support a broad range of businessgoals. These include “load balancing,” “caller segmentation” and“geographic routing.” Load balancing refers to distribution of calls sothat the expected answer delay for new calls is similar across all thecall centers. If other considerations do not dictate otherwise, loadbalancing is desirable because it provides optimum efficiency in the useof agents and facilities, and it provides the most consistent grade ofservice to callers. In special situations it might be desirable tounbalance the load in a particular way, but control over thedistribution of call load is still desired.

If the caller's identity can be inferred from the calling number,caller-entered digits, or other information, that identity may influencethe choice of destination for the call. Call routing based on suchinformation is referred to as caller segmentation. Also, it has beenfound desirable for particular call centers to handle calls fromparticular geographic areas. The motivation may be to minimize calltransport costs, to support pre-defined call center “territories”, or totake advantage of agents specifically trained to handle calls from givenlocations. Such techniques are known as geographic routing.

The interexchange carriers who provide 800 service today generallysupport some form of “routing plan” to help achieve load balancing,caller segmentation and geographic routing. Typically these routingplans allow 800 call routing based on time of day, day of week, thecaller's area code, caller-entered digits, and fixed percentageallocations. Predominately, however, the routing plans supported by thecarriers are static in the sense that they do not automatically react tounexpected variations in incoming call volume or distribution, nor toactual call delays being experienced at each destination. Reaction tochanging conditions is done via manual modification of the plan, on atime scale of minutes or hours.

Recent service offerings from some interexchange carriers offer somedegree of automatic reaction to changing conditions. One such offering,called “alternate termination sequence” or “ATS” (from AT&T), allowscustomers to establish maximum numbers of calls to be queued for eachdestination, with a pre-defined alternative when a primary destinationis overloaded. Another offering, referred to as “intelligent routingcontrol” or “IRC” (from MCI), allows an ACD to refuse a call from thenetwork, again resulting in pre-defined alternative call handling. Athird kind of service, AT&T's Intelligent Call Processing, lets theinterexchange network pass call-by-call data to a computer.

In a conventional ACD, phone calls are processed on a first-in,first-out basis: the longest call waiting is answered by the nextavailable agent. Answering calls across multiple automated calldistributors (ACD) is typically done on a first-in, first-out basisdependent upon time of receipt of the call by each ACD, whether the callis directly connected or forwarded.

Another call distribution scheme is provided in Gechter et al., U.S.Pat. No. 5,036,535. This patent discloses a system for automaticallydistributing telephone calls placed over a network to one of a pluralityof agent stations connected to the network via service interfaces, andproviding status messages to the network. Gechter et al.'s disclosedsystem includes means for receiving the agent status messages and callarrival messages from the network, which means are connected via anetwork service interface to the network. Routing means responsive tothe receiving means is provided for generating a routing signal providedto the network to connect the incoming call to an agent station throughthe network. In the system disclosed in Gechter et al, when an incomingcall is made to the call router, it decides which agent station shouldreceive the call, establishes a call with that agent station, and thentransfers the original call onto the second call to connect the incomingcaller directly to the agent station and then drops out of theconnection.

U.S. Pat. No. 5,193,110 issued to Jones et al discloses an integratedservices platform for a telephone communications system which platformincludes a plurality of application processing ports for providingdifferent types of information services to callers. In Jones et al'sdisclosed system, a master control unit and a high speed digital switchare used to control processing of incoming phone calls by recognizingthe type of service requested by the caller and then routing the call tothe appropriate processing port. The Jones et al system is disclosed asan adjunct to current switching technology in public and privatenetworks.

Intelligent Call Management

Call centers are also used to make outbound calls, for example fortelemarketing. Agents making outbound calls, referred to as outboundagents, are typically separate from ACD agents handling inbound callsand call center software separately manages outbound call lists foroutbound agents to ensure that each outbound agent wastes little time indialing or in performing overhead operations.

A call center typically has multiple agents for answering incoming callsand placing outgoing calls. A call center may also have agentsparticipating in outgoing call campaigns, typically in conjunction withan outbound call management system. Each agent may be assigned to aparticular group, such as an inbound group or an outbound group. Agentscan also be assigned to a supervisor team, which represents multipleagents that report to the same supervisor.

In certain situations, it is necessary to restrict an agent's activityto answering calls or handling a particular type of call (e.g.,answering only incoming calls). For example, during an outboundcampaign, the system placing the outbound calls and controlling the rateat which the calls are placed, e.g., a so-called predictive dialer,relies on the availability of the agent to handle an answered call. Ifthe system places outbound calls expecting the agent to be available,but the agent instead places their own call to another agent or asupervisor, or has an incoming call connected to them, the outboundsystem may not have an agent available to handle an answered outboundcall. Additionally, if an agent is assigned to handle incoming calls,but instead places a call to another agent or listens to voice mailmessages, the number of queued incoming calls may increase, therebyincreasing the waiting time experienced by the callers.

One document which provides considerable information on intelligentnetworks is “ITU-T Recommendation Q.1219, Intelligent Network User'sGuide for Capability Set 1”, dated April, 1994. This document isincorporated herein by reference.

One known system proposes a call-management method and system fordistributing calls to a plurality of individuals, such as automatic calldistribution (ACD) agents, which routes calls to the individuals basedupon a correlation of attributes of the individuals with calls that aretagged with identification of abilities that are advantageous toefficiently processing the calls. That is, for each call that is to bedistributed, one or more skills that are relevant to efficient handlingof the call are determined and then used to route the call to anappropriate individual. In addition, call management preferences mayalso be accommodated.

Personalization and Collaborative Filtering

Known systems allow personalization or prediction of user type,preferences or desires based on historical data or limited informationavailable. These known systems have been applied to a number ofdifferent domains.

In a non-collaborative personalization system, the available informationabout a person is analyzed, and based on this information, conclusionsare drawn. In a collaborative system, the available information is usedto associate the person with a group of other users having commonattributes. By grouping users, the data sets are more dense, permittingmore detailed inferences to be drawn. The groups are defined by mappinguser attributes in a multidimensional space, and then defining clustersof users having correlated traits. Further, the use of data relating topast transactions of other users allows prediction of outcomes andsequences of actions, without having a true past example of the activityfrom that particular user.

The following references are expressly incorporated herein by reference:

U.S. Pat. Nos. 6,418,424; 6,400,996; 6,081,750; 5,920,477; 5,903,454;5,901,246; 5,875,108; 5,867,386; 5,774,357; 6,529,891; 6,466,970;6,449,367; 6,446,035; 6,430,558; 6,412,012; 6,389,372; 6,356,899;6,334,131; 6,334,127; 6,327,590; 6,321,221; 6,321,179; 6,317,722;6,317,718; 6,266,649; 6,256,648; 6,253,193; 6,236,980; 6,236,978;6,185,683; 6,177,932; 6,170,742; 6,146,026; 6,138,119; 6,112,186;6,112,181; 6,078,928; 6,016,475; 5,999,908; 5,560,011; 6,484,123;6,480,844; 6,477,246; 6,421,709; 6,405,922; 6,353,813; 6,345,264;6,314,420; 6,308,175; 6,144,964; 6,029,161; 6,018,738; 6,016,475;6,006,218; 5,983,214; 5,867,799; 5,79,935;B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Item-basedcollaborative filtering recommendation algorithms. In Proc. 10thInternational World Wide Web Conference (WWW10), Hong Kong, May 2001.Rashid, A. M., Albert, I., Cosley, D., Lam, S. K., McNee, S., Konstan,J. A., & Riedl, J. (2002). Getting to Know You: Learning New UserPreferences in Recommender Systems. In Proceedings of the 2002International Conference on Intelligent User Interfaces, San Francisco,Calif., pp. 127-134.O'Connor, M., Cosley, D., Konstan, J. A., & Riedl, J. (2001). PolyLens:A Recommender System for Groups of Users. In Proceedings of ECSCW 2001,Bonn, Germany, pp. 199-218.Schafer, J. B., Konstan, J., and Riedl, J., Electronic CommerceRecommender Applications. Journal of Data Mining and KnowledgeDiscovery, vol. 5 nos. 1/2, pp. 115-152.Herlocker, J., Konstan, J., and Riedl, J., Explaining CollaborativeFiltering Recommendations. In proceedings of ACM 2000 Conference onComputer Supported Cooperative Work, Dec. 2-6, 2000, pp. 241-250.Sarwar, B. M., Karypis, G., Konstan, J. A., and Riedl, J. “Analysis ofRecommender Algorithms for E-Commerce”. In proceedings of theACME-Commerce 2000 Conference. Oct. 17-20, 2000, pp. 158-167.Sarwar, B. M., Konstan, J. A., and Riedl, J. “Distributed RecommenderSystems: New Opportunities for Internet Commerce”. In the book “InternetCommerce and Software Agents: Cases, Technologies andOpportunities”Rahman, S., and Bignall, R. eds.Sarwar, B. M., Karypis, G., Konstan, J. A., and Riedl, J. “Applicationof Dimensionality Reduction in Recommender System—A Case Study”. ACMWebKDD 2000 Web Mining for E-Commerce Workshop.Schafer, J. B., Konstan, J., and Riedl, J., Recommender Systems inE-Commerce. Proceedings of the ACM Conference on Electronic Commerce,Nov. 3-5, 1999.Good, N., Schafer, J. B., Konstan, J., Borchers, A., Sarwar, B.,Herlocker, J., and Riedl, J., Combining Collaborative Filtering withPersonal Agents for Better Recommendations. Proceedings of the 1999Conference of the American Association of Artifical Intelligence(AAAI-99). pp 439-446,Herlocker, J., Konstan, J., Borchers, A., Riedl, J. An AlgorithmicFramework for Performing Collaborative Filtering. To appear inProceedings of the 1999 Conf. on Res. and Dev. in Information Retrieval.August 1999.Sarwar, B., Konstan, J., Borchers, A., Herlocker, J., Miller, B., andRiedl, J. Using Filtering Agents to Improve Prediction Quality in theGroupLens Research Collaborative Filtering System. Proceedings of the1998 Conference on Computer Supported Cooperative Work. November 1998.Konstan, J., Miller, B., Maltz, D., Herlocker, J., Gordon, L., andRiedl, J. GroupLens: Applying Collaborative Filtering to Usenet News.Communications of the ACM 40,3 (1997), 77-87.Miller, B., Riedl, J., and Konstan, J. Experiences with GroupLens:Making Usenet useful again. Proceedings of the 1997 Usenix WinterTechnical Conference. January 1997.Resnick, P., Iacovou, N., Sushak, M., Bergstrom, P., and Riedl, J.GroupLens: An open architecture for collaborative filtering of netnews.Proc. of the 1994 Computer Supported Collaborative Work Conf. (1994)Combining Content-Based and Collaborative Filters.—Claypool. (1999)www.cs.umbc.edu/^(˜)ian/sigir99-rec/papers/claypool_m.ps.gzDistributing Information for Collaborative Filtering on Usenet Net . . .—Maltz (1994)www.cs.cmu.edu/afs/cs.cmu.edu/user/dmaltz/Doc/mit-thesis.ps.gzIntegrating Knowledge-based and Collaborative-filtering . . . —Burke(1999) www.ics.uci.edu/^(˜)burke/research/papers/burke-aiec99.pdfAnalysis of the Axiomatic Foundations of CollaborativeFiltering—Pennock, Horvitz (1999)www.eecs.umich.edu/^(˜)dpennock/homepage/papers/imposs-CF.psSocial Choice Theory and Recommender Systems: Analysis of . . .—Pennock, Horvitz, Giles (2000)www.neci.nj.nec.com/homepages/dpennock/papers/CF-imposs-aaai-00.psDeveloping Trust in Recommender Agents—Montaner, López, Rosa (2002)eia.udg.es/^(˜)mmontane/montaner-aamas02.pdfRecTree: An Efficient Collaborative Filtering Method—Sonny Han Sengwww.cs.sfu.ca/^(˜)wangk/pub/dawakfin.pdfContent-Boosted Collaborative Filtering for Improved . . . —Melville,Mooney . . . (2002) www.cs.utexas.edu/users/ml/papers/cbcf-aaai-02.ps.gzKnowledge Pump: Community-centered Collaborative Filtering—NatalieGlance www.ercim.org/publication/ws-proceedings/DELOS5/arregui.ps.gzEmpirical Analysis of Predictive Algorithms for . . . —Breese,Heckerman, Kadie (1998) www.cs.auc.dk/research/DSS/papers/ALM002a.psGroupLens: An Open Architecture for Collaborative . . . —Resnick,Iacovou, . . . (1994)www.cs.kun.nl/is/research/filter/literature/GroupLens.psLearning Collaborative Information Filters—Daniel Billsus Michael (1998)www.ics.uci.edu/^(˜)dbillsus/papers/icml98.pdfNewsWeeder: Learning to Filter Netnews—Lang (1995)www.fi.muni.cz/usr/popelinsky/newsweeder.ps.gzCombining Collaborative Filtering with Personal . . . —Good, Schafer . .. (1999) www-users.cs.umn.edu/^(˜)herlocke/aaai-99.pdfTowards Adaptive Web Sites: Conceptual Framework and CaseStudy—Perkowitz, Etzioni (2000)www.cs.washington.edu/homes/map/research/papers/www8.psWeb Mining: Information and Pattern Discovery on the . . . —Cooley,Mobasher . . . (1997)maya.cs.depaul.edu/^(˜)mobasher/papers/webminer-tai97.psPHOAKS: A System for Sharing Recommendations—al. (1997)www.pensivepuffin.net/%7Edavid/papers/Terveen.CACM97.pdfLatent Semantic Indexing: A Probabilistic Analysis—Papadimitriou,Raghavan . . . (1998) lsa.colorado.edu/papers/lsi.math.prob_analysis.psAutomatic Personalization Based on Web Usage Mining—Mobasher, Cooley,Srivastava (1999)maya.cs.depaul.edu/^(˜)mobasher/personalization/personalization.psJust Talk to Me: A Field Study of Expertise Location—Mcdonald, Ackermann(1998) www.ics.uci.edu/^(˜)dmcdonal/papers/cscw98.final.pdfApplication of Dimensionality Reduction in . . . —Sarwar, Karypis . . .(2000)www-users.cs.umn.edu/^(˜)karypis/publications/Papers/PDF/webkdd.pdfContent-Based Book Recommending Using Learning for Text . . . —Mooney,Roy (2000) ftp.cs.utexas.edu/pub/mooney/papers/libra-dl-00.ps.gzDocument Categorization and Query Generation on . . . —Boley, Gini . . .(1999) www-users.cs.umn.edu/^(˜)gross/papers/aij.agent.psThe Emerging Role of Electronic Marketplaces on the Internet—Bakos(1998)www-ec.njit.edu/^(˜)bartel/B2Breports/EmergingRoleOfElectronicMarketplaces.pdfReferralWeb: Combining Social Networks and Collaborative . . . —Kautz,Selman, Shah (1997)akpublic.research.att.com/^(˜)kautz/papers-ftp/refwebCACM.psContent-Boosted Collaborative Filtering—Melville, Mooney, Nagarajan(2001) www.cs.utexas.edu/users/ml/papers/cbcf-sigir-wkshp-01.ps.gzIntelligent Internet Systems—Levy, Weld (2000)www.cs.auc.dk/research/DSS/papers/levyweld00.pdfUsing Data Mining Methods to Build Customer Profiles—Adomavicius,Tuzhilin (2001) www.eng.auburn.edu/users/wenchen/mining.pdfTailoring the Interaction with Users in Web Stores—Ardissono, Goy (2001)www.di.unito.it/^(˜)liliana/EC/umuai-per-www.ps.gzUsing Filtering Agents to Improve Prediction . . . —Sarwar, Konstan . .. (1998) www.cs.umn.edu/Research/GroupLens/filterbot-CSCW98.pdfLatent Semantic Indexing: A Probabilistic Analysis—Papadimitriou,Raghavan . . . (1997) www.cs.berkeley.edu/^(˜)christos/ir.psHorting Hatches an Egg: A New Graph-Theoretic Approach to . . .—Aggarwal, Wolf, Wu, Yu (1999) web.mit.edu/charu/www/kdd386.psAn Efficient Boosting Algorithm for Combining Preferences—Iyer, Jr.(1998) www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-811.pdfImplicit Rating and Filtering—Nichols (1998)www.ercim.org/publication/ws-proceedings/DELOS5/nichols.ps.gzItem-based Collaborative Filtering Recommendation . . . —Sarwar,Karypis, Konstan, . . . (2001)www-users.itlabs.umn.edu/^(˜)karypis/publications/Papers/Postscript/www10_sarwar.psDiscovery of Aggregate Usage Profiles for Web . . . —Mobasher, Dai, Luo. . . (2000) maya.cs.depaul.edu/^(˜)mobasher/papers/webkdd2000.pdfCombining Content-Based and Collaborative Filters . . . —Claypool . . .(1999) www.cs.umbc.edu/^(˜)ian/sigir99-rec/papers/claypool_m.ps.gzClustering Methods for Collaborative Filtering—Ungar, Foster (1998)www.cis.upenn.edu/datamining/Publications/clust.pdfA Framework Of Knowledge Management Systems: Issues And . . . —JungpilHahn Mani (2000) www.akindofmagic.com/^(˜)jhahn/./papers/hs_icis2000.pdfIdentification of Web User Traffic Composition using Multi-Modal . . .—Heer, Chi (2000)www-users.cs.umn.edu/^(˜)echi/papers/SIAM-data-mining-2001/SIAM-Data-Mining-MMC2.pdfUsing User Models in Music Information Retrieval Systems—Wei Chai Barry(2000) www.media.mit.edu/^(˜)chaiwei/papers/usermodeling.pdfFinding Interesting Associations without Support Pruning—Edith CohenMayur www.stanford.edu/^(˜)datar/papers/icde00.psA Design Process for Embedding Knowledge Management . . . —Hoffmann,Loser . . . (1999)iundg.informatik.uni-dortmund.de/Daten/pubs/HoffLosWalHerr_Group99.pdfJoining Collaborative and Content-based Filtering—Baudisch (1999)ipsi.fhg.de/^(˜)baudisch/publications/1999-Baudisch-RecSys99-JoiningCollaborativeAndContent-basedFiltering.pdfIntelligent Software Agents:Turning a Privacy Threat into a . . .—Borking, al. (1999) www.ipc.on.ca/english/pubpres/papers/isat.pdfHigh Performance Computing with the Array Package . . . —Moreira,Midkiff . . . (1999) www.sc99.org/proceedings/papers/moreira1.pdfTo Each and Everyone an Agent: Augmenting Web-Based . . . —Eriksson,Finne, Janson (1998) www.sics.se/^(˜)sverker/public/papers/agentweb.pdfCollaborative filtering approach for software function . . . —Ohsugi,Monden, Morisaki (2002)se.aist-nara.ac.jp/^(˜)akito-m/home/research/paper/ohsugi_collaborativeFiltering_isese2002.pdfA Survey On Web Information Retrieval Technologies—Lan Huang Computerranger.uta.edu/^(˜)alp/ix/readings/SurveyOfWebSearchEngines.pdfOn the Effects of Idiotypic Interactions for Recommendation—CommunitiesIn Artificialwww.aber.ac.uk/icaris-2002/Proceedings/paper-16/paper16.pdfA Concept-Based Retrieval Tool:—The Cooperative Webdi002.edv.uniovi.es/^(˜)dani/publications/gayoicwi02.PDFCenters for IBM e-business Innovation—Adaptive Marketing Buildingwww.systemicbusiness.org/pubs/2000_IBM_e-Business_Wittenstein_Adaptive_Marketing.pdfA Recommender System based on the Immune Network—Steve Cayzer Andwww-uk.hpl.hp.com/people/steve_cayzer/Publications/020514Immune_Recommender.pdfApplying Natural Language Processing (NLP) Based—Metadata Extraction Toranger.uta.edu/^(˜)alp/ix/readings/p116-paik-metadata-extraction-from-communications.pdfAugmenting the Knowledge Bandwidth and Connecting . . . —Novak, Wurst .. . (2002) maus.gmd.de/^(˜)jas/papers/kmn02.pdfA recommendation system for software function discovery—Ohsugi, Monden,Matsumoto (2002)se.aist-nara.ac.jp/^(˜)akito-m/home/research/paper/ohsugi_apsec2002_recommendation.pdfThe Role of Semantic Relevance in Dynamic User Community . . .—Papadopoulos . . . (2002)www.mm.di.uoa.gr/^(˜)rouvas/ssi/caise2002/23480200.pdfPersonalisation—How Computer Can, mms.ecs.soton.ac.uk/papers/14.pdfEvaluating Emergent Collaboration on the Web—Terveen, Hill (1998)www.research.att.com/^(˜)terveen/cscw98.psThe Decision-Theoretic Video Advisor—Nguyen, Haddawy (1998)www.cs.uwm.edu/faculty/haddawy/pubs/hien-aaai98wkshp.ps.ZThe Order of Things: Activity-Centred Information Access—Chalmers,Rodden, Brodbeck (1998)www.ubs.com/e/index/about/ubilab/print_versions/ps/cha98.ps.gzAlleviating the Latency and Bandwidth Problems in WWW Browsing—Tong Sau(1997)bbcr.uwaterloo.ca/^(˜)brecht/courses/756/readings/prefetching/alleviating-USITS97.psA Case-Based Reasoning View of Automated Collaborative . . . —ConorHayes Pdraig (2001)ftp.cs.tcd.ie/pub/tech-reports/reports.01/TCD-CS-2001-09.pdfBeyond Algorithms: An HCI Perspective on Recommender Systems—KirstenSwearingen Rashmi (2001)www.sims.berkeley.edu/^(˜)sinha/papers/BeyondAlgorithms.pdfCollaborative Learning for Recommender Systems—Lee (2001)www.comp.nus.edu.sg/^(˜)leews/publications/icml01.psA Multi-Agent TV Recommender—Kaushal Kurapati Srinivas (2001)www.cs.umbc.edu/^(˜)skaush1/um_2001.pdfWeb Dynamic—Levene, Poulovassilis (2001)www.dcs.bbk.ac.uk/^(˜)mark/download/web_focus_final.pdfCapturing knowledge of user preferences: ontologies in . . . —Middleton,De Roure . . . (2001) www.ecs.soton.ac.uk/^(˜)sem99r/kcap-paper.pdfData mining models as services on the internet—Sarawagi, Nagaralu (2000)www.it.iitb.ernet.in/^(˜)sunita/papers/sigkdd.pdfEffective Personalization Based on Association Rule . . . —Mobasher,Dai, Luo . . . (2001) maya.cs.depaul.edu/^(˜)mobasher/papers/widm01.pdfA Customer Purchase Incidence Model Applied to . . . —Geyer-Schulz,Hahsler . . . (2001)wwwai.wu-wien.ac.at/^(˜)hahsler/research/recomm_webKDD2001/paper/geyerschulz.pdfOn the Value of Private Information—Jon Kleinberg Cornell (2001)www.eecs.Berkeley.edu/^(˜)christos/tark.psInferring User Interest—Claypool, Brown, Le, Waseda (2001)ftp.cs.wpi.edu/pub/techreports/01-07.ps.gzProbabilistic Models for Unified Collaborative and . . . —Popescul,Ungar . . . (2001)www.cis.upenn.edu/^(˜)popescul/Publications/popescul01probabilistic.psEvaluation of Item-Based Top-N Recommendation Algorithms—Karypis (2000)www-users.itlabs.umn.edu/^(˜)karypis/publications/Papers/Postscript/itemrs.psExpertise Recommender: A Flexible Recommendation System and . . .—McDonald, Ackerman (2000)www.ics.uci.edu/^(˜)ackerman/pub/00b30/cscw00.er.pdfA Regression-Based Approach for Scaling-Up Personalized . . . —Vucetic,Obradovic (2000)robotics.stanford.edu/^(˜)ronnyk/WEBKDD2000/papers/vucetic.psClustering the Users of Large Web Sites into Communities—GeorgiosPaliouras. gdit.iiit.net/wdkm/2.pdfMatching—van der Putten (2002)www.liacs.nl/^(˜)putten/library/2002stt_65_part_3_2_6.pdfTechnical Solutions for Controlling Spam—Shane Hird Distributedsecurity.dstc.edu.au/papers/technical_spam.psMining Web Logs for Personalized Site Maps—Toolan, Kushmerick (2002)www.cs.ucd.ie/staff/nick/home/research/download/toolan-mews2002.pdfElectronic Commerce Software Agents: How to Increase Their—Machine IqLuis fie.engrng.pitt.edu/iie2002/proceedings/ierc/papers/2080.pdfSimRank: A Measure of Structural-Context Similarity—Jeh, Widom (2002)www-cs-students.stanford.edu/^(˜)glenj/simrank.psBayesian Mixed-Eects Models for Recommender Systems—Michelle Keim Condliwww.stat.rutgers.edu/^(˜)madigan/PAPERS/collab.psEnhancing Web-Based Configuration With . . .—Coster.ectrl.itc.it/rpec/RPEC-Papers/04-coster.pdfExperiments on Query Expansion for Internet Yellow . . . —Ohura,Takahashi, . . . (2002)www.tkl.iis.u-tokyo.ac.jp/Kilab/Research/Paper/2002/ohura/VLDB2002Ohura.pdfDynamic Modeling and Learning User Profile In Personalized News . . .—Widyantoro students.cs.tamu.edu/dhw7942/thesis.psOptimizing Return-Set Size for Requirements Satisfaction and . . .—Branting (2002) www.karlbranting.net/papers/isec-2002.psTaxonomy of Large Margin Principle—Algorithms For Ordinal (2002)leibniz.cs.huji.ac.il/tr/acc/2002/HUJI-CSE-LTR-2002-43_k-planes-long.psCollaborative Preference Elicitation in a Group—Travel RecommenderSystem ectrl.itc.it/rpec/RPEC-Papers/17-plua.pdfCase-Based Reasoning to Improve Adaptability of Intelligent . . . —Funk,Conlan www.mrtc.mdh.se/publications/0420.pdfAn on-Line Evaluation Framework for Recommender Systems—Hayes, Massa,Avesani . . . (2002) ectrl.itc.it/rpec/RPEC-Papers/06-hayes.pdfUnder consideration for publication in Knowledge and . . . —LearningFeature Weights www.karlbranting.net/papers/kais.psA Formal Model for User Preference—Jung, Hong (2002)mobigen.com/^(˜)chopin/research/publish/ICDM2002/syjung_IEEE_ICDM2002_A_Formal_Model_for_Preference.psBuilding Recommender Systems using a Knowledge Base of Product . . .—Ghani, Fano ectrl.itc.it/rpec/RPEC-Papers/05-ghani.pdfEvaluation of Recommender Algorithms for an Internet . . .—Geyer-Schulz, Hahsler (2002)wwwai.wu-wien.ac.at/^(˜)hahsler/research/recomm_webkdd2002/final/webkdd2002.pdfHow Is an Agent Like a Wolf?: Dominance and Submission in . . . —BillTomlinson Brucebadger.www.media.mit.edu/people/badger/Publications/MAMA-175.pdfImproving Learning Accuracy in Information Filtering—de Kroon, Mitchell,Kerckhoffs (1996) www.ics.forth.gr/^(˜)moustaki/ICML96_HCI_ML/kroon.psData Manipulation Services in the Haystack IR System—Asdoorian (1998)grebe.lcs.mit.edu/papers/Asdoorian.thesis.ps.gzCondensing Image Databases when Retrieval is based on . . . —DavidJacobs (1998) cs.nyu.edu/cs/faculty/weinshal/papers/nonmetric-ret.ps.gzReport on the CONALD Workshop on Learning from Text . . . —Carbonell,Craven . . . (1998)www.cs.cmu.edu/^(˜)yiming/papers.yy/conald98-report.psConCall: An information service for researchers based . . . —Waern,Tierney . . . (1998)ftp.sics.se/pub/SICS-reports/Reports/SICS-T--98-04--SE.ps.ZBook Recommending Using Text Categorization with Extracted . . . —Mooney(1998) ftp.cs.utexas.edu/pub/mooney/papers/libra-textcat98.ps.gzSOAP: Live Recommendations through Social Agents—Guo (1997)www.sztaki.hu/conferences/delosbudapest/papers/guo.psAgent Based Personalized Information Retrieval—Kramer (1997)grebe.lcs.mit.edu/papers/kramer-thesis.ps.gzFeature-Guided Automated Collaborative Filtering—Lashkari (1995)ftp.media.mit.edu/pub/yezdi/proposal.psLet's stop pushing the envelope and start addressing . . . —Whittaker,Terveen . . . (2000)www.research.att.com/^(˜)stevew/reference_task_hci2000.pdfIntegrating Web Usage and Content Mining for More . . . —Mobasher, Dai,Luo . . . (2000) maya.cs.depaul.edu/^(˜)mobasher/papers/ecweb2000.psA Framework Of Knowledge Management Systems: Issues And . . . —JungpilHahn Mani (2000) www.akindofmagic.com/^(˜)jhahn/./papers/hs_icis2000.pdfIdentification of Web User Traffic Composition using Multi-Modal . . .—Heer, Chi (2000)www-users.cs.umn.edu/^(˜)echi/papers/SIAM-data-mining-2001/SIAM-Data-Mining-MMC2.pdfUsing User Models in Music Information Retrieval Systems—Wei Chai Barry(2000) www.media.mit.edu/^(˜)chaiwei/papers/usermodeling.pdfLearning about Users from Observation—Schwab, Kobsa, Koychev (2000)fit.gmd.de/^(˜)koychev/papers/AAAI00.psCase-Based User Profiling for Content Personalisation—Bradley, Rafter,Smyth (2000) kermit.ucd.ie/casper/ah2000bradley.psAutomated Collaborative Filtering Applications for Online . . . —Rafter,Bradley, Smyth (2000) kermit.ucd.ie/casper/AH2000.psA Case-Based Reasoning Approach to Collaborative Filtering—Burke (2000)www.ics.uci.edu/^(˜)burke/research/papers/burke-ewcbr00.pdfSocial Choice Theory and Recommender Systems: Analysis of . . .—Pennock, Horvitz, Giles (2000)www.neci.nj.nec.com/homepages/dpennock/papers/CF-imposs-aaai-00.psRobustness Analyses of Instance-Based CollaborativeRecommendation—Kushmerick (2002)www.cs.ucd.ie/staff/nick/home/research/download/kushmerick-ecml2002.pdfCollaborative recommendation: A robustness analysis—O'Mahony, Hurley . .. (2002)www.cs.ucd.ie/staff/nick/home/research/download/omahony-acmtit2002.pdfImpact and Potential of User Profiles Used for Distributed Query . . .—Schmitt www.cg.cs.tu-bs.de/v3d2/pubs.collection/edbt02.pdfDocument Classification as an Internet service: Choosing the best . . .—Godbole (2001) www.it.iitb.ac.in/^(˜)shantanu/work/mtpsg.pdfImproving Collaborative Filtering with Multimedia Indexing . . . —ArndKohrs Bernard (1999) www.eurecom.fr/^(˜)kohrs/publish/ACMMM99.ps.gzContent-Boosted Collaborative Filtering for Improved . . . —Melville,Mooney . . . (2002) www.cs.utexas.edu/users/ml/papers/cbcf-aaai-02.ps.gzExploiting Synergy Between Ontologies and Recommender . . . —Middleton,Alani . . . (2002) www.ecs.soton.ac.uk/^(˜)sem99r/www-paper.psClustering for Collaborative Filtering Applications—Kohrs, Merialdo(1999) www.eurecom.fr/^(˜)kohrs/publish/CIMCA99.ps.gzDynamic Information Filtering—Baudisch (2001)ipsi.fhg.de/^(˜)baudisch/publications/2001-Baudisch-Dissertation-DynamicInformationFiltering.pdfCollaborative Filtering with Privacy—Canny (2002)www.cs.berkeley.edu/^(˜)jfc/papers/02/IEEESP02.pdfUsing Color and Texture Indexing to improve Collaborative . . . —ArndKohrs And (1999) www.eurecom.fr/^(˜)kohrs/publish/CBMI99.ps.gzTV Scout: Lowering the entry barrier to personalized TV . . . —Baudisch,Brueckner (2002)ipsi.fhg.de/^(˜)baudisch/publications/2002-Baudisch-AH2002-TVScoutLoweringTheEntryBarrier.pdfA Cooperating Hybrid Neural-CBR Classifiers for Building . . . —Malek,Kanawati (2001)www.aic.nrl.navy.mil/papers/2001/AIC-01-003/ws5/ws5toc8.PDFUsing Category-Based Collaborative Filtering In The Active . . . —ArndKohrs And (2000) www.eurecom.fr/^(˜)kohrs/publish/ICME2000.ps.gzEnhancing Product Recommender Systems on Sparse Binary Data—Demirizwww.rpi.edu/^(˜)demira/productrecommender.ps.gzQuery Expansion using Collaborative Filtering Algorithm—Brandberg (2001)ftp.csd.uu.se/pub/papers/masters-theses/0207-brandberg.pdfAdaptivity through Unobstrusive Learning—Ingo Schwab Alfred (2002)www.ics.uci.edu/%7Ekobsa/papers/2002-KI-kobsa.pdfCompositional Cbr Via Collaborative Filtering—Aguzzoli, Avesani, Massa(2001) sra.itc.it/tr/AAM01.ps.gzApplication of ART2 Networks and Self-Organizing Maps to . . . —GuntramGraef And (2001) wwwis.win.tue.nl/ah2001/papers/graef-schaefer-1.pdfA Theoretical Analysis of Query Selection for Collaborative . . . —Lee,Long www.comp.nus.edu.sg/^(˜)leews/publications/colt01.pdfElectronic Commerce: a technological perspective—Rocha, Oliveira (1999)www.fe.up.pt/^(˜)eol/PUBLICATIONS/ec98.psA Brief Comparison of News Filtering Software—Fredrik Kilander (1995)www.cs.kun.nl/is/research/filter/literature/Comparison.psSOaP: Social Agents Providing People with Useful Information—Voss,Kreifelts (1997) www.gmd.de/fit/publications/ebk-publications/SOaP.pdfChoices in the Implementation of Rating—Palme (1997)www.ercim.org/publication/ws-proceedings/DELOS5/palme.pdfThe Virtual Participant: Lessons to be Learned from a Case-Based . . .—Masterton (1997) kmi.open.ac.uk/techreports/papers/kmi-tr-47.ps.gzShared Web Annotations as a Platform for Third-Party . . . —Röscheisen .. . (1994) www-diglib.stanford.edu/diglib/pub/reports/commentor.psCollaborative Browsing and Visualisation of the Search Process—Twidale,Nichols (1996) ftp.comp.lancs.ac.uk/pub/reports/1996/CSEG.3.96.ps.ZWebWatcher: Machine Learning and Hypertext—Thorsten Joachims (1995)mobile.csie.ntu.edu.tw/^(˜)yjhsu/courses/u1760/papers/webwatcher.ps.gzTo Each and Everyone an Agent: Augmenting Web-Based . . . —Eriksson,Finne, Janson (1998) www.sics.se/^(˜)sverker/public/papers/agentweb.pdfA Survey of Applications of CSCW for Digital Libraries—Twidale, Nichols(1998) ftp.comp.lancs.ac.uk/pub/reports/1998/CSEG.4.98.pdfCampiello—New user interface approaches for community . . . —AntoniettaGrasso Michael (1998)www11.informatik.tu-muenchen.de/publications/pdf/Grasso1998a.pdfAutomatic learning of user profiles—towards the . . . —Soltysiak,Crabtree (1998)www.labs.bt.com/projects/agents/publish/papers/bttj98-profiling.pdfParaSite: Mining the Structural Information on the World-WideWeb—Spertus (1998) www.mills.edu/ACAD_INFO/MCS/SPERTUS/Thesis/thesis.pdfInformation Filtering—Palme (1998)dsv.su.se/jpalme/select/information-filtering.pdfRecommending TV Programs: How far can we get at zero usereffort?—Baudisch (1998);www-cui.Darmstadt.gmd.de/^(˜)baudisch/Publications/baudisch1998bRecommendingTVProgramsAtZeroUserEffort.psReferences for: Machine learning on non-homogeneous, distributed . . .—Mladenic (1998)www.cs.cmu.edu/afs/cs/project/theo-4/textlearning/www/pww/papers/PhD/PhDBib.ps.gzClass Representation and Image Retrieval with Non-Metric . . . —Jacobs,Weinshall . . . (1998) www.neci.nj.nec.com/homepages/dwj/non-metric.psThe Profile Editor: Designing a direct manipulative tool for . . .—Baudisch (1997)www.ercim.org/publication/ws-proceedings/DELOS5/delos5.pdfA Visual Tagging Technique for Annotating . . . —Chandrinos . . . (1997)www.ics.forth.gr/^(˜)kostel/papers/delos5.ps.gzSocial Filtering and Social Reality—Lueg (1997)ftp.ifi.unizh.ch/pub/institute/ailab/papers/lueg/delos97.ps.gzSOaP: Social Filtering through Social Agents—Hui Guo (1997)www.ercim.org/publication/ws-proceedings/DELOS5/guo.ps.gzGRAS: An Adaptive Personalization Scheme for Hypermedia . . . —Kahabka,Korkea-aho . . . (1997)www3.informatik.tu-muenchen.de/public/mitarbeiter/specht/lit/97-HIM-gras.psA Collaborative Filtering Agent System for Dynamic Virtual . . . —deVel, Nesbitt www.cs.jcu.edu.au/^(˜)olivier/projects/web/conald98.psExplaining Collaborative Filtering Recommendations—Herlocker, al.www.cs.umn.edu/Research/GroupLens/explain-CSCW.pdfWebACE: A Web Agent for Document Categorization and Exploration—Eui-HongSam www-users.cs.umn.edu/gross/papers/agents98.psOnline Queries for Collaborative Filtering—Boutilier, Zemelwww.cs.toronto.edu/^(˜)cebly/Papers/_download_/querycf.psEfficient and Tunable Similar Set Retrieval—Aristides Gionis Stanforddiglib.stanford.edu/^(˜)gionis/papers/sigmod01.psIntelliShopper: A Proactive, Personal, Private Shopping . . . —Menczer,Street . . . dollar.biz.uiowa.edu/^(˜)fil/Papers/intellishopper.pdfSemantic ratings and heuristic similarity for collaborative . . . —Burkeecommerce.cbc.fullerton.edu/^(˜)rburke/pubs/burke-kbem00.pdfAdaptive-FP: An Efficient And Effective Method For Multi-Level . . .—Mao (2001) fas.sfu.ca/pub/cs/theses/2001/RunyingMaoMSc.ps.gzClassification and Clustering Study in Incomplete Data Domain.—Rodas,Gramajo www.lsi.upc.es/dept/techreps/ps/R01-11.pdf.gzModeling e-business with eBML—Lagha inforge.unil.ch/yp/Pub/01-cimre.pdfEngineering an Ontology for a Multi-Agents Corporate MemorySystem—Acacia (2001);www-sop.inria.fr/acacia/personnel/Fabien.Gandon/research/ismick2001/article_fabien_gandon_ismick2001.pdfA Rapidly Acquired Domain Model Derived from Markup Structure—UdoKruschwitz Department cswww.essex.ac.uk/staff/udo/papers/esslli.ps.gzeBusiness Model Design, Classification and Measurements—Dubosson-Torbayinforge.unil.ch/yp/Pub/01-thunderbird.pdfBeyond Document Similarity: Understanding . . .—Paepcke.www-db.stanford.edu/^(˜)cho/papers/info-filter.pdfLightweight Collaborative Filtering Method for . . . —Lightweight . . .www.research.ibm.com/dar/papers/pdf/weiss_pkdd01.pdfMechanisms For Coping With Unfair Ratings And . . . —Chrysanthos . . .(2000) ccs.mit.edu/dell/icis2000.pdfThe MARS Adaptive Social Network for Information Access . . . —ResultsBin Yu www4.ncsu.edu/^(˜)byu/papers/mars-experiments.pdfAn adaptive system for the personalized access to news—Ardissono,Console, Torre www.di.unito.it/^(˜)liliana/EC/aiComm01.pdfWeb Usage Mining for a Better Web-Based Learning Environment—Zaiane(2001) www.cs.ualberta.ca/^(˜)zaiane/postscript/CATE2001.pdfAugmenting Recommender Systems by Embedding Interfaces . . . —AntoniettaGrasso . . . (1999)www.xrce.xerox.com/research/ct/publications/Documents/P10226/content/HICSS-33.psExtending Recommender Systems: A Multidimensional Approach—Adomavicius,Tuzhilin www.mineit.com/lc/ijcai/papers/adomavicius.pdfMOVIES2GO—A new approach to online movie recommendation—Mukherjee,Dutta, Sen www.mineit.com/lc/ijcai/papers/mukherjee.pdfPassive Profiling from Server Logs in an Online Recruitment . . . —Barrywww.mineit.com/lc/ijcai/papers/rafter.pdfA Theoretical Analysis of Query Selection for Collaborative . . . —Lee,Long www.comp.nus.edu.sg/^(˜)leews/publications/colt01.psExperience in Ontology Engineering for a Multi-Agents Corporate . . .—Gandon (2001);www-sop.inria.fr/acacia/personnel/Fabien.Gandon/research/IJCAI2001/article_fabien_gandon_ijcai2001.psAgent-Mediators In Media-On-Demand Eletronic Commerce—Joo Paulo Andradewwwhome.cs.utwente.nl/^(˜)guizzard/mod-amec-cuba.pdfImproving the Effectiveness of Collaborative Filtering . . . —Mobasher,Dai, Luo . . . www.mineit.com/lc/ijcai/papers/mobasher.pdfSimilarity Measures on Preference Structures, Part II . . . —Ha,Haddawy, al. www.cs.uwm.edu/^(˜)vu/papers/uai01.ps.gzTowards a Multiagent System for Competitive Website Ratings—Nickles(2001)wwwbrauer.informatik.tu-muenchen.de/fki-berichte/postscript/fki-243-01.ps.gzA Framework For Personalizable Community Web Portals—Lacher, Koch,Wörndl (2001) www11.in.tum.de/publications/pdf/lacher2001a.pdfData Mining At The Interface Of Computer Science And Statistics—Smyth(2001) www.ics.uci.edu/^(˜)datalab/papers/dmchap.psTechnical Paper Recommendation: A Study in . . . —Basu, Hirsh . . .(2001) www.cs.washington.edu/research/jair/volume14/basu01a.psLearning about User in the Presence of Hidden Context—Koychevwww.dfki.de/^(˜)rafer/um01-ml4um-ws/papers/IK.pdfConstruction of Adaptive Web-Applications from Reusable . . . —Graef,Gaedke (2000) www.teco.edu/^(˜)graef/paper/ecweb-graef-gaedke-sv2.pdfEducational and scientific recommender systems . . . —Geyer-Schulz,Hahsler, . . . (2001)wwwai.wu-wien.ac.at/^(˜)hahsler/research/recomm_ijee2001/paper.pdfDynamic Recommendations In Internet Retailing—Ai Li Ng (2001)www.eltrun.aueb.gr/papers/ecis2001.pdfData Mining, Decision Support and Meta-Learning . . .—Blanzieri.ww.science.unitn.it/^(˜)pgiorgio/ic/ws01.ps.gzSome Issues in the Learning of Accurate, Interpretable User . . .—Wittig www.dfki.de/^(˜)rafer/um01-ml4um-ws/papers/FW.ps.gzDesigning for Social Navigation of Food Recipes—Höök, Laaksolahti,Svensson . . . www.sics.se/^(˜)martins/publications/hook.pdfCollaborative Filtering via Implicit Culture Support—Blanzieri,Giorgini, Massa . . . (2001)www.science.unitn.it/^(˜)pgiorgio/ic/ic-um2001.ps.gzWeb Usage Mining with Inductive Logic Programming—Tveit (2000)cavenan.idi.ntnu.no/amund/publications/2000/WebMiningWithILP.pdfPersonalization by Partial Evaluation—Ramakrishnan, Rosson,www.cs.vt.edu/TR/pipe-techreport.psFinding Relevant Litterature for Agent Research—Tveit (2000)cavenan.idi.ntnu.no/amund/publications/2000/AgentLitteratureSearch.pdfTemporary User Modeling for Adaptive Product Presentations in the . . .—Joerding www.cs.usask.ca/UM99/Proc/DC/joerding.pdfA Recipe Based On-Line Food Store—Svensson, Laaksolahti, Waern, Höök(2000) www.sics.se/^(˜)martins/publications/chi99.pdfTowards An Adaptive Mail Classifier—Manco, Masciari, Ruffolo, Tagarelli(2002) www-dii.ing.unisi.it/aiia2002/paper/APAUT/manco-aiia02.pdfA Knowledge Discovery Methodology for the—Performance Evaluation Ofwww.cs.purdue.edu/homes/verykios/personal/papers/kais98.psDynamic Profiling in a Real-Time Collaborative . . . —Kurhila . . .(2002) cosco.hiit.fi/edutech/publications/its2002.pdfEDUCO—A Collaborative Learning Environment based . . . —Kurhila . . .(2002) cosco.hiit.fi/edutech/publications/ah2002.pdfUsing Ontologies to Discover Domain-Level Web Usage Profiles—Dai,Mobasher maya.cs.depaul.edu/^(˜)mobasher/papers/swm02.pdfBayesian Learning For Personlization In—Information Retrieval Varundcs.vein.hu/CIR/cikkek/paper_acmsig.pdfUnknown—If Adopted Thesewww.kdnuggets.com//gpspubs/ieee-intelligent-dec-1999-x6032.pdfCollaborative Filtering with Privacy via Factor Analysis—Cannywww.cs.berkeley.edu/^(˜)jfc/papers/02/SIGIR02.pdfRecTree: An Efficient Collaborative Filtering Method—Sonny Han Sengwww.cs.sfu.ca/^(˜)wangk/pub/dawakfin.pdfRatings in Distributed Systems: A Bayesian Approach—Lik Mui Mojdehwww.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TM-617.pdfAn Information Architecture-based Framework for . . . —Keith InstoneArgus (2000)www.zurich.ibm.com/^(˜)mrs/chi2000/contributions/instone.pdfSwe88] J. A. Swets, Measuring the accuracy of diagnostic . . . —June ThaTereen (2000) fas.sfu.ca/pub/cs/theses/2000/SonnyHanMengCheeMSc.pdfImplicit Culture for Information Agents—Blanzieri, Giorginiwww.science.unitn.it/^(˜)pgiorgio/ic/blanzieri-giorgini.pdf.gzPersonalization and Community Communication for Customer Support—Koch,Schubert (2002) www11.in.tum.de/publications/pdf/Koch2002.pdfFoundations for building a digital sister-in-law: explicitly . . .—Groves, Kay www.ted.cmis.csiro.au/adcs01/012_Groves.pdfImmunizing Online Reputation Reporting Systems Against . . .—Chrysanthos. ccs.mit.edu/dell/ecooreputation.pdfVirtual Reviewers for Collaborative Exploration—Of Movie Reviewlieber.www.media.mit.edu/people/lieber/IUI/Tatemura/Tatemura.pdfSocial Network Analysis of Information Sharing Networks in . . .—Hichang Cho Michael newmedia.colorado.edu/cscl/88.pdfRobustness Analyses of Instance-Based CollaborativeRecommendation—Kushmerick (2002)www.cs.ucd.ie/staff/nick/home/research/download/kushmerick-ecml2002.pdfCollaborative recommendation: A robustness analysis—O'Mahony, Hurley . .. (2002)www.cs.ucd.ie/staff/nick/home/research/download/omahony-acmtit2002.pdfImpact and Potential of User Profiles Used for Distributed Query . . .—Schmitt www.cg.cs.tu-bs.de/v3 d2/pubs.collection/edbto2.pdfDocument Classification as an Internet service: Choosing the best . . .—Godbole (2001) www.it.iitb.ac.in/^(˜)shantanu/work/mtpsg.pdfImproving Collaborative Filtering with Multimedia Indexing . . . —ArndKohrs Bernard (1999) www.eurecom.fr/^(˜)kohrs/publish/ACMMM99.ps.gzContent-Boosted Collaborative Filtering for Improved . . . —Melville,Mooney . . . (2002) www.cs.utexas.edu/users/ml/papers/cbcf-aaai-02.ps.gzExploiting Synergy Between Ontologies and Recommender . . . —Middleton,Alani . . . (2002) www.ecs.soton.ac.uk/^(˜)sem99r/www-paper.psClustering for Collaborative Filtering Applications—Kohrs, Merialdo(1999) www.eurecom.fr/^(˜)kohrs/publish/CIMCA99.ps.gzDynamic Information Filtering—Baudisch (2001)ipsi.fhg.de/^(˜)baudisch/publications/2001-Baudisch-Dissertation-DynamicInformationFiltering.pdfCollaborative Filtering with Privacy—Canny (2002)www.cs.berkeley.edu/^(˜)jfc/papers/02/IEEESP02.pdfUsing Color and Texture Indexing to improve Collaborative . . . —ArndKohrs And (1999) www.eurecom.fr/^(˜)kohrs/publish/CBMI99.ps.gzTV Scout: Lowering the entry barrier to personalized TV . . . —Baudisch,Brueckner (2002)ipsi.fhg.de/^(˜)baudisch/publications/2002-Baudisch-AH2002-TVScoutLoweringTheEntryBarrier.pdfA Cooperating Hybrid Neural-CBR Classifiers for Building . . . —Malek,Kanawati (2001)www.aic.nrl.navy.mil/papers/2001/AIC-01-003/ws5/ws5toc8.PDFUsing Category-Based Collaborative Filtering In The Active . . . —ArndKohrs And (2000) www.eurecom.fr/^(˜)kohrs/publish/ICME2000.ps.gzEnhancing Product Recommender Systems on Sparse Binary Data—Demirizwww.rpi.edu/^(˜)demira/productrecommender.ps.gzQuery Expansion using Collaborative Filtering Algorithm—Brandberg (2001)ftp.csd.uu.se/pub/papers/masters-theses/0207-brandberg.pdfAdaptivity through Unobstrusive Learning—Ingo Schwab Alfred (2002)www.ics.uci.edu/%7Ekobsa/papers/2002-KI-kobsa.pdfCompositional Cbr Via Collaborative Filtering—Aguzzoli, Avesani, Massa(2001) sra.itc.it/tr/AAM01.ps.gzApplication of ART2 Networks and Self-Organizing Maps to . . . —GuntramGraef And (2001) wwwis.win.tue.nl/ah2001/papers/graef-schaefer-1.pdfA Theoretical Analysis of Query Selection for Collaborative . . . —Lee,Long www.comp.nus.edu.sg/^(˜)leews/publications/colt01.pdfCOOL-TOUR: A Case Based Reasoning System for Tourism Culture . . .—Blanzieri, Ebranati sra.itc.it/tr/BE00.ps.gzUsing Content-Based Filtering for Recommendation—van Meteren, vanSomeren www.ics.forth.gr/^(˜)potamias/mlnia/paper_6.pdfSystems That Adapt to Their Users—Description of an IJCAI01 . . .—Jameson www.cs.uni-sb.de/users/jameson/ijcai01-tutorial-jameson.pdfOn the Effects of Dimensionality Reduction on High Dimensional . . .—Aggarwal (2001) web.mit.edu/charu/www/dim.psA System for Collaborative Web Resource Categorization andRanking—Lifantsevwww.ecsl.cs.sunysb.edu/^(˜)maxim/cgi-bin/Get/SCWRCR.ps.gzUser Interface Research Center 380 Gui Lane Hillsville, N.Y. . . . —MarySmith Computer (2001) www.dcs.gla.ac.uk/equator/2001/09/workshop.pdfDesigning User-Adaptive Systems—Description of an IUI 2001 . . .—Jameson www.cs.uni-sb.de/users/jameson/iui01-tutorial-jameson.pdfLearning a Gaussian Process Prior for . . . —Platt, Burges.research.microsoft.com/^(˜)jplatt/autoDJ.pdfFEATURES: Real-Time Adaptive Feature and Document Learning . . . —Chen,Meng, Fowler www.cs.panam.edu/^(˜)chen/./paper-file/features.ps.ZTalkMine: a Soft Computing Approach to Adaptive Knowledge . . . —LuisMateus Rocha wwwc3.lanl.gov/^(˜)rocha/ps/softagents.pdfCombining Dynamic Agents and Collaborative Filtering . . . —SaranyaManeeroj Hideakiwww.ercim.org/publication/ws-proceedings/DelNoeoz/Saranya.pdfCollaborative Filtering as means to reduce information overload—Hughes,O'Riordan www.it.nuigalway.ie/TR/abstracts/./papers/sh.ps.gzShopping Anytime Anywhere—O'Hara, Perrywww.brunel.ac.uk/^(˜)cssrmjp/homefiles/selected-publications/oharaandperry.PDFZhang, J. (Unpublished)—Distributed Representation Approachwww.brunel.ac.uk/^(˜)cssrmjp/MP_thesis/references.pdfA Bidding Mechanism for Web-Based Agents Involved in . . . —Rajeev RajeSnehasis (1998) www.avl.iu.edu/^(˜)mjboyles/papers/bidding.psAssociation Models For Web Mining—Giudici, Castel (2001)www.cs.uu.nl/^(˜)roberto/kddj2k1.pdfA Framework for Implicitly Tracking Data—Robert Villa Andwww.ercim.org/publication/ws-proceedings/DelNoe02/RobertVilla.pdfD-SIFTER: A Collaborative Information Classifier—Rajeev Raje Snehasiswww.avl.iu.edu/^(˜)mjboyles/papers/dsifter.psKnowledgescapes: A Probabilistic Model for Mining Tacit Knowledge . . .—Chengwww.cs.berkeley.edu/^(˜)jfc/papers/01/heyning/ms_knowledgescapes.pdfIntegrating User Data and Collaborative Filtering . . . —Buono,Costabile, . . . (2001) wwwis.win.tue.nl/ah2001/papers/costabile.pdfA Performance Evaluation of the Acorn Architecture—Bhaysar, Ghorbani,Marsh (2000) www.cs.unb.ca/profs/ghorbani/ali/./papers/hpcs00.psCollaborative Filtering—Griffith, O'Riordan (2000)www.it.nuigalway.ie/TR/./rep00/NUIG-IT-160900.ps.gzInformation Filtering and Retrieval: An Overview—Riordan, Sorensenwww.it.nuigalway.ie/TR/abstracts/./papers/cor.ps.gzContent Personalisation for WAP-Enabled Devices—Smyth, Cotterwww.icsforth.gr/^(˜)potamias/mlnia/paper_8.pdfGetting to Know Each Other on the Web: Using Web Server Access . . .—Lueg (2001) www-staff.it.uts.edu.au/^(˜)lueg/papers/www2001.ps.gzRank Aggregation Revisited—Dwork, Kumar, Naor, Sivakumarwww.cs.berkeley.edu/^(˜)christos/games/readings/rank.psUser Interfaces for All—Kobsa, (eds.) (1999)www.gmd.de/publications/report/0074/Text.pdfUser Modeling and Adaptivity in Nomadic Information Systems—Specht,Oppermann fit.gmd.de/^(˜)oppi/publications/ABIS-hip.pdfCollaborative Filtering with the Simple Bayesian Classifier—Miyahara,Pazzani www.ics.uci.edu/^(˜)pazzani/Publications/koji.pdfCombining Content-based and Collaborative Filtering—Polcicova, Navratwww.dcs.elf.stuba.sk/emg/filter.psPaths and Contextually Specific Recommendations—Matthew ChalmersUniversitywww.ercim.org/publication/ws-proceedings/DelNoe02/MathewChalmers.pdfComparing Recommendations Made by Online Systems and Friends—RashmiSinha Andwww.sims.berkeley.edu/^(˜)sinha/papers/Recommenders_Delos01.PDFAn Economic Framework For Web-Based Collaborative . . . —Rajeev RajeSnehasis (1997) www.avl.iu.edu/^(˜)mjboyles/papers/economic.psIntelligent Agents in Electronic Markets for . . . —Aron, Sundararajan .. . (2001) oz.stern.nyu.edu/papers/agent.pdfFlycasting: Using Collaborative Filtering to Generate a . . . —Hauver,French (2001) www.cs.virginia.edu/^(˜)cyberia/papers/wedelmusic.psDesign and Development of a Cooperative Shopping System . . . —Umeda,Tarumi . . .www.isse.kuis.kyoto-u.ac.jp/^(˜)tarumi/research/papers/iwcmc.pdfFlycasting: On the Fly Broadcasting—James Frenchwww.cs.virginia.edu/^(˜)cyberia/papers/flycast.pdfThe Use Of Case-Based Reasoning (CBR) For Knowledge Enablement Of . . .—Hodgson (2000) www.ifcomputer.co.jp/sol2000/papers/hodgson.pdfUnknown—(1998) gregridgeway.homestead.com/files/jsm1998.pdfHuman Language Technologies for Knowledge Management . . . —Mark MayburyInformationwww.mitre.org/support/papers/tech_papers_01/maybury_humanlanguage/maybury_hlt.pdfIntelliShopper: A Proactive, Personal, Private Shopping . . . —Menczer,Street . . . dollar.biz.uiowa.edu/^(˜)fil/Papers/intellishopper.pdfSemantic ratings and heuristic similarity for collaborative . . . —Burkeeommerce.cbe.fullerton.edu/^(˜)rburke/pubs/burke-kbem00.pdfContent-Based Techniques—That Filter Content (2000)www.cs.vt.edu/^(˜)ramakris/papers/ic2000.pdfSWAMI: A Framework for Collaborative Filtering Algorithm . . . —DanyelFisher Kris www.cs.berkeley.edu/^(˜)richie/swami/sigir00-final/report.psOnline Clustering for Collaborative Filtering—Wee Sun Leehal.comp.nus.edu.sg/recommender/Papers/online/online.ps.gzDEMOIR A Hybrid Architecture for Expertise Modeling and . . . —Yimam,Kobsa (2000) www.ics.uci.edu/^(˜)kobsa/papers/2000-IEEE-kobsa.pdfUsage, Rating & Filtering—Nicholswww.sztaki.hu/conferences/delosbudapest/papers/DELOS-dmn.psThe Pivotal Role of Community Building in Electronic Commerce—Schubertstudnet.fhbb.ch:8081/pschubert/publications/pdf-files/cicsp04.pdfCollaborative Filtering Methods based on Fuzzy Preference . . . —PatricePerny And www-poleia.lip6.fr/^(˜)zucker/Papers/PPIDZ99.pdfDoes “Authority” Mean Quality? Predicting Expert Quality . . . —Amento,Terveen, Hill (2000) www.research.att.com/^(˜)terveen/sigir2000.psDependency Networks for Inference, Collaborative Filtering . . .—Heckerman, al. (2000)www.ai.mit.edu/projects/jmlr/papers/volume1/heckerman00a/heckerman00a.ps.gzReference Task Agenda—Let's Stop Pushingwww.research.att.com/^(˜)terveen/envelope.psInvolving Remote Users in Continuous Design of Web Content—Hill, Terveenwww.research.att.com/^(˜)terveen/dis97.psInforming the Design of Shared Bookmark Systems—Rushed Kanawati Maria(2000)133.23.229.11/^(˜)ysuzuki/Proceedingsall/RIAO2000/Wednesday/15AP1.pdfVirtual Communities of Transaction: The Role of . . . —Schubert, al.(1999)studnet.fhbb.ch:8081/pschubert/publications/pdf-files/ta-community_schubert_ginsburg.pdfThe “ebay Of Blank”: Digital Intermediation In Electronic . . . —Chircu,Kauffman (2000)webfoot.csom.umn.edu/faculty/phds/achircu/researchweb/ck_bh_2000.pdfA Comparative Study of Approaches to Chance Discovery—Prendinger,Ishizuka www.miv.t.u-tokyo.ac.jp/papers/helmut-sigfai00.pdfThe Adaptive Place Advisor: A Conversational Recommendation . . .—Göker, Thompson www.cs.utah.edu/^(˜)cindi/papers/gwcbr.ps.gzBuy and Sell—Pattie Macs et al.www.cis.upenn.edu/^(˜)lee/oocis640/papers/maes.pdfLess is More—When IT Comes to Knowledge Management—Gunnarsson, Lindroth. . . (2000) iris23.htu.se/proceedings/PDF/110final.PDFBehind-the-Scenes Data Mining:—Report On Thediagnosis.xjtu.edu.cn/kdd/john.psRecom Syst—High Volume And . . .—www.ics.uci.edu/^(˜)pratt/courses/papers/p77-konstan.pdfMixtures of Gaussian Processes—Tresp (2001)dnkweb.denken.or.jp/boosting/papers/upload_7245_moe_gpr2.psDistributing digital music over the internet—a chance for the . . .—Schulz (2000)www.ebs.de/Lehrstuehle/Wirtschaftsinformatik/Lehre/Seminar00/p_schulz.pdfDynamic Modeling and Learning User Profile in Personalized News . . .—Widyantoro (1999) www.cs.tamu.edu/research/CFL/current/thesis.ps.gzUsing Narratives, Humor, and Social Navigation: An . . . —Svensson,Persson, Höök www.sics.se/^(˜)perp/UserModelling99.pdfLearning User Interests through Positive Examples Using . . . —Schwab,Kobsa, Koychev fit.gmd.de/^(˜)koychev/papers/MLJ-paper.pdfAdaptation to Drifting User's Interests—Koychev, Schwab (2000)fit.gmd.de/^(˜)koychev/papers/MLNIA00.psActive Exploration in Instance-Based Preference Modeling—Branting (1999)pyramid.cs.uwyo.edu/^(˜)karl/papers/iccbr99a.psDependency Networks for Inference, Collaborative . . . —Heckerman . . .(2000) www.cs.brown.edu/people/amygreen/seminar/dependency.pdfCognitive Filtering of Information by Evolutionary . . . —Höfferer,Knaus, Winiwarterftp.ifs.univie.ac.at/pub/werner.winiwarter/ki94if.ps.gzCollaborative—Filtering Thomas Hofmannwww.cs.brown.edu/people/th/papers/HofmannPuzicha-IJCAI99.pdfAccurate Recasting of Parameter Estimation Algorithms . . .—Demonstrated For . . .www.hpl.hp.com/org/stl/dmsd/publications/ParaPKDD.pdfA multiagent architecture for a web-based adaptive . . . —Boticario,Gaudioso newatlantis.isle.org/^(˜)aui/papers/JBoticario00.psImprovements to Collaborative Filtering Algorithms—Gokhale (1999)www.cs.wpi.edu/^(˜)claypool/ms/cf-improve/cf-improve.psSelf-Adaptive Web-Applications—Graef, Gaedke (2000)www.teco.edu/^(˜)gaedke/paper/2000-www9-poster.pdfNetworked Distributed Collaboration for Information Activity . . .—Murthy Murthy Csa bheeshma.csa.iisc.ernet.in/^(˜)krish/docs/NDC.ps.gzLet's stop pushing the envelope and start addressing it: . . .—Whittaker, Terveen . . . (2000)www.research.att.com/^(˜)stevew/envelope-5-15-00-FINAL.pdfGetting to Know Each Other on the Web: Using Web Server Access . . .—Lueg (2000) ftp.ifi.unizh.ch/pub/institute/ailab/papers/lueg/aus2000.psSandip Sen—Mathematical Computer Scienceseuler.mcs.utulsa.edu/^(˜)sandip/aa00-ba.psMiBiblio: Personal Spaces in a Digital Library Universe—Fernández . . .ict.pue.udlap.mx/pubs/Mibiblio.ps.gzDealing With Community Data—Bruckman, Erickson, Fisher, Luegwww.cs.berkeley.edu/^(˜)danyelf/research/cscw-workshop.pdfA Hyperlink-Based Recommender System Written in Squeal—Spertus, Steinwww.mills.edu/ACAD_INFO/MCS/SPERTUS/widm98.pdfCollaborative Maintenance—Maria-Angela Ferrario Barry (1999)www.cs.ucd.ie/pubs/1999/../../staff/bsmyth/home/crc/aics99b.psA Recipe Based On-line Food Store—Svensson, Laaksolahti, Höök, Waern(2000) lieber.www.media.mit.edu/people/lieber/IUI/Svensson/Svensson.pdfMining the Web's Hyperlinks for Recommendations—Spertus, Steinwww.mills.edu/ACAD_INFO/MCS/SPERTUS/recommender-workshop.pdfIntraNews: A News Recommending Service for Corporate Intranets—Fagrellwww.viktoria.informatik.gu.se/groups/mi3/results/papers/intranews.pdfRecommendation systems: a probabilistic analysis—Kumar, Raghavan . . .(1998) www.almaden.ibm.com/cs/k53/./algopapers/focs98rec.psFrom Instances to Classes in Probabilistic Relational Models—Getoor,Koller, Friedman (2000)www.informatik.uni-freiburg.de/^(˜)ml/icml2000_workshop/getoor.psClient-Side Proxies—Better Way To cmc.dsv.su.se/select/csp/thesis.pdfIntegrating Community Services—A Common Infrastructure Proposal—Koch,Lacher (2000) www11.in.tum.de/publications/pdf/Koch2000.pdfDesign Principles For Social Navigation Tools—Forsberg, Höök, Svenssonwww.ics.forth.gr/proj/at-hci/UI4ALL/UI4ALL-98/forsberg.pdfDiscovering Collaborators by Analyzing Trails Through . . . —Paytoneksl-www.cs.umass.edu/aila/payton.pdfThe Experimental Study of Adaptive User Interfaces—Langley, Fehlingwww.isle.org/^(˜)langley/papers/adapt.exper.ps.gzSmart Radio—a proposal—Conor Hayes(1999)ftp.cs.tcd.ie/pub/tech-reports/reports.99/tcd-cs-1999-24.pdfReasoning with Partial Preference Models—Ha (2000)cs.uwm.edu/^(˜)vu/papers/proposal.pdfParallel Data Mining using the Array Package for Java—Moreira, Midkiff,Gupta . . . www.research.ibm.com/people/g/gupta/sc99.psBulletin of the Technical Committee on—March Vol Noftp.research.microsoft.com/pub/debull/marA00-a4final.psScalable Techniques for Clustering the Web (Extended . . . —Haveliwala,Gionis, Indyk (2000) www.research.att.com/conf/webdb2000/PAPERS/8c.psRecommending Expertise in an Organizational Setting—McDonaldwww.ics.uci.edu/^(˜)dmcdonal/papers/chi99.final.pdfA Countermeasure to Duplicate-detecting Anti-spam Techniques—Robert HallAtt www.research.att.com/resources/trs/./TRs/99/99.9/99.9.1.body.psPersonalized Decentralized Communication—Olsson, Rasmusson, Jansonwww.sics.se/^(˜)tol/publications/s3 -business-processes.pdf

The MARS Adaptive Social Network for Information Access . . . —Bin YuMahadevanwww.csc.ncsu.edu/faculty/mpsingh/papers/mas/mars-experiments.ps

Knowledge-based recommender systems—Burke (2000)www.ics.uci.edu/^(˜)burke/research/papers/kb-recommender-reprint.ps.gz

From Collaborative Filtering to Implicit Culture: a general . . .—Blanzieri, Giorgini (2000)www.cs.unitn.it/^(˜)pgiorgio/papers/wars2000.ps.gz

Web-Collaborative Filtering: Recommending Music by Spidering The . . .—Cohen, Fan (2000) www.cs.columbia.edu/^(˜)wfan/papers/www9.ps.gz

i3 Annual Conference COVERSHEET for—Submissions Category Offreak.gmd.de/NIS/Docs/i3secondAnnualConference.pdf

Using Probabilistic Relational Models for CollaborativeFiltering—Getoor, Sahami (1999)viror.wiwi.uni-karlsruhe.de/webmining/bib/pdf/Getoor1999.pdf

Information Awareness and Representation—Chalmerswww.dcs.glasgow.ac.uk/personal/personal/matthew/papers/awarenessRepn.pdf

Extending a Collaborative Architecture to Support . . . —Garcia, Favela. . . www.ai.mit.edu/people/jvelas/ebaa99/garcia-ebaa99.pdf

Michael J. Wright—Michael Wrig Htwww.cs.colorado.edu/^(˜)sumner/cs3202/kmi-tr-75.pdf

Clustering Items for Collaborative Filtering—Connor, Herlockerwww.cs.umbc.edu/^(˜)ian/sigir99-rec/papers/oconner_m.pdf

Recommending HTML-documents using Feature Guided . . . —Polcicova,Slovak . . . (1999)www.cs.umbc.edu/^(˜)ian/sigir99-rec/papers/polcicova_g.ps.gz

Reasoning With Conditional Ceteris Paribus Preference . . . —Boutilier,Brafman . . . (1999) www.cs.ubc.ca/spider/hoos/Publ/uai99.ps.gz

Correlation Thresholds for More Accurate Collaborative . . . —AnujaGokhale Mark ftp.cs.wpi.edu/pub/techreports/99-17.ps.gz

Combining Content and Collaboration in Text Filtering—Nicholas (1999)www.cs.umbc.edu/^(˜)ian/pubs/mlif.ps.gz

Collaborative Maintenance—Ferrario, Smyth (1999)www.cs.tcd.ie/Conor.Hayes/cbrnet/pub/UCD-CBRNET-1999.ps

A Use Centred Framework For Evaluation Of The Web—Pejtersen, Dunlop,Fidel www.dei.unipd.it/^(˜)ims/sigir99/papers/3-pejtersen.ps

Using Semi-intelligent Filtering Agents to Improve Prediction . . .—Sarwar (1998) www-users.cs.umn.edu/^(˜)sarwar/ms.ps

Supporting Collaborative Information Activities in . . . —Glance,Grasso, al. (1999)inf2-www.informatik.unibw-muenchen.de/People/borghoff/pspapers/hci99.ps

Personalising On-Line Information Retrieval Support with a Genetic . . .—Er (1996) www.cee.hw.ac.uk/^(˜)jeff/files/changing.ps.Z

Information Services Based on User Profile Communication—Waern, Averman,Tierney . . . (1999) www.sics.se/^(˜)annika/papers/UM99.ps

Bibliography—Agrawal Mannilawww.cs.cmu.edu/^(˜)TextLearning/pww/papers/PhD/PhDBib.ps.gz

Radio CBR—An Application Proposal—Conor Hayes (1999)www.cs.tcd.ie/Conor.Hayes/cbrnet/pub/TCD-CS-1999-24.ps

A Java-Based Approach to Active Collaborative Filtering—Lueg, Landolt(1998) ftp.ifi.unizh.ch/pub/institute/ailab/papers/lueg/chi98_late.ps.Z

Text Categorization Through Probabilistic Learning: Applications . . .—Bennett (1998)ftp.cs.utexas.edu/pub/mooney/papers/pbennett-ugthesis.ps.Z

Supporting Situated Actions in High Volume Conversational Data . . .—Lueg (1998)ftp.ifi.unizh.ch/pub/institute/ailab/papers/lueg/chi98.ps.gz

Using d' to Optimize Rankings—Vogt, Cottrell (1998)www.cs.ucsd.edu/^(˜)vogt/papers/dprime/dprime.ps

Intelligent Collaborative Information Retrieval—Actively . . . —Delgado,ISHII, URA (1998)www-ishii.ics.nitech.ac.jp/^(˜)jdelgado/iberamia98.ps.gz

(Collaborative Filtering)cairo.aist-nara.ac.jp/^(˜)tomohi-f/Docs/cofil.ps.gz

An Adaptive Usenet Interface Supporting Situated Actions—Lueg (1997)ftp.ifi.unizh.ch/pub/institute/ailab/papers/lueg/ercim97.ps.gz

PEFNA—The Private Filtering News Agent—Kilander, Fåhraeus, Palme (1997)www.dsv.su.se/^(˜)fk/if_Doc/Pefna/pefna.ps.Z

Knowing Me, Knowing You: Practical Issues in the . . . —Soltysiak,Crabtree (1998)www.labs.bt.com/projects/agents/publish/papers/ss_bc-paam98.ps

EYE: Using Location-based Filtering for a Shopping Agent in the . . .—Fano www.ac.com/services/cstar/documents/ao86fano.ps

Reasoning With Conditional Ceteris Paribus Preference . . . —Boutilier,Brafman, al. (1999) www.cs.ubc.ca/spider/cebly/Papers/CPnets.ps

Decentralised Social Filtering based on Trust—Tomas Olsson (1998)www.sics.se/^(˜)tol/publications/socialfiltering.ps

Agent Mediated Collaborative Web Page Filtering—Shaw Greenwww.cs.tcd.ie/research_groups/aig/iag/cia.ps

Intelligent Information Filtering—Kilander, Fåhraeus, Palme (1997)www.dsv.su.se/^(˜)fk/if_Doc/juni96/ifrpt.ps.Z

Experimental Investigation of High Performance Cognitive and . . .—Douglas Oard www.cs.kun.nl/is/research/filter/literature/perf.ps

Collaborative Filtering with LSI: Experiments with Cranfield—Soboroff(1998) www.cs.umbc.edu/^(˜)ian/pubs/tr9801.ps.gz

Unknown—www.cs.pdx.edu/^(˜)kenrick/papers/infoproc.ps.gz

Profile—A Proactive Information Filter—Hoenkamp, Schomaker, van Bommel,. . . (1996) ftp.cs.kun.nl/pub/SoftwEng.InfSyst/articles/FilterInit.ps.Z

Social Affordances and Implicit Ratings for Social Filtering . . .—Procter, McKinlaywww.ercim.org/publication/ws-proceedings/DELOS5/procter.ps.gz

Knowledge Pump: Community-centered Collaborative Filtering—NatalieGlance www.ercim.org/publication/ws-proceedings/DELOS5/arregui.ps.gz

Personalization of the Automotive Information Environment—Seth Rogers(1997) www.isle.org/^(˜)langley/papers/route.ml97.ps

Collaborative Information Gathering—Grasso, Borghoff, Glance, al. (1998)inf2-www.informatik.unibw-muenchen.de/People/borghoff/pspapers/euromedia98b.ps

Integrated Information Search In The Www And A Human Group—Seiji YamadaMotohiro (2000)ftp.ymd.dis.titech.ac.jp/pub/doc/references/2000/INFORMS-2000-mase.ps.gz

Hypertext Information Retrieval for the Web—Brown, Smeatonlorca.compapp.dcu.ie/SIGIR98-wshop/SIGIR-Forum-summary.ps

Features: Real-time Adaptive Feature Learning and . . . —Chen, Meng,Fowler, Zhu (2000) bahia.cs.panam.edu/techrpt/features.ps

Evolving User Profiles to Reduce Internet Information Overload—Pagonis,Sinclair esewww.essex.ac.uk/^(˜)mcs/ps/rasc00_pag.ps.gz

GroupLens: An Open Architecture for Collaborative Filtering—Miller(1995) ftp.cs.umn.edu/dept/users/bmiller/prop.ps

Collaborative Aspects of Information Retrieval Tools . . . —Stenmark(2000) w3.adb.gu.se/^(˜)dixi/publ/iris23ca.pdf

A Logic-Based Approach for Adaptive Information Filtering . . . —RaymondLau Arthur www.icis.qut.edu.au/^(˜)arthur/articles/iia.ps.Z

Semantic ratings and heuristic similarity for collaborative . . . —Burkewww.igec.umbc.edu/kbem/final/burke.pdf

Learning Bayesian Networks from Data—Unknown (1998)www.cs.huji.ac.il/^(˜)nir/tutorial/readings.ps

The SELECT Protocol for Rating and Filtering—Palme, Kaers (2000)www.ietf.org/internet-drafts/draft-palme-select-00.ps

Knowledge Based Recommender Systems Using Explicit User Models—Towle,Quinn www.igec.umbc.edu/kbem/final/towle.pdf

Searching The Web—Meta-Search Hybrid Approacheswww.cs.washington.edu/education/courses/cse574/98wi/toc.ps

Collaborative Document Monitoring via a Recommender System—NatalieGlance Daminwww.xrce.xerox.com/research/ct/publications/Documents/P98437/content/kpma-wars.pdf

A Multiagent system for Content Based Navigation of Music—De Roure,El-Beltagy . . . (1999)www.bib.ecs.soton.ac.uk/data/4464/PDF/mascbnm.pdf

A system to restructure hypertext networks into valid user . . .—Bollen, Heylighen (1998)lib-www.lanl.gov/^(˜)jbollen/pubs/JBollen_NRHM99.pdf

The Evolution of a Practical Agent-based Recommender System—SamhaaEl-Beltagy David www.bib.ecs.soton.ac.uk/data/4495/postscript/rec4.ps

Let's Get Personal—Personalised Television Listings on the . . . —Smyth,Cotter, O'Hare (1998)www.cs.ucd.ie/pubs/1998/../../staff/bsmyth/home/crc/aics98a.ps

Collaboratively Searching the Web—An Initial Study . . . —Center ForIntelligentnone.cs.umass.edu:1234/^(˜)schapira/thesis/report/report.ps.gz

Passive Profiling and Collaborative Recommendation—Rafter, Bradley,Smyth (1999)www.cs.ucd.ie/pubs/1999/../../staff/bsmyth/home/crc/aics99f.ps

Similarity Measures on Preference Structures, Part II . . . —Ha,Haddawy, al. www.cs.uwm.edu/^(˜)vu/papers/uai01.ps.gz

Towards a Multiagent System for Competitive Website Ratings—Nickles(2001)wwwbrauer.informatik.tu-muenchen.de/fki-berichte/postscript/fki-243-01.ps.gz

A Framework For Personalizable Community Web Portals—Lacher, Koch,Wörndl (2001) www11.in.tum.de/publications/pdf/lacher2001a.pdf

Data Mining At The Interface Of Computer Science And Statistics—Smyth(2001) www.ics.uci.edu/^(˜)datalab/papers/dmchap.ps

Technical Paper Recommendation: A Study in . . . —Basu, Hirsh . . .(2001) www.cs.washington.edu/research/jair/volume14/basu01a.ps

Learning about User in the Presence of Hidden Context—Koychevwww.dfki.de/^(˜)rafer/um01-ml4um-ws/papers/IK.pdf

Construction of Adaptive Web-Applications from Reusable . . . —Graef,Gaedke (2000) www.teco.edu/^(˜)graef/paper/ecweb-graef-gaedke-sv2.pdf

Educational and scientific recommender systems . . . —Geyer-Schulz,Hahsler, . . . (2001)wwwai.wu-wien.ac.at/^(˜)hahsler/research/recomm_ijee2001/paper.pdf

Dynamic Recommendations In Internet Retailing—Ai Li Ng (2001)www.eltrun.aueb.gr/papers/ecis2001.pdf

Data Mining, Decision Support and Meta-Learning . . . —Blanzieri . . .www.science.unitn.it/^(˜)pgiorgio/ic/ws01.ps.gz

Some Issues in the Learning of Accurate, Interpretable User . . .—Wittig www.dfki.de/^(˜)rafer/um01-ml4um-ws/papers/FW.ps.gz

Designing for Social Navigation of Food Recipes—Höök, Laaksolahti,Svensson . . . www.sics.se/^(˜)martins/publications/hook.pdf

Collaborative Filtering via Implicit Culture Support—Blanzieri,Giorgini, Massa . . . (2001)www.science.unitn.it/^(˜)pgiorgio/ic/ic-um2001.ps.gz

Web Usage Mining with Inductive Logic Programming—Tveit (2000)cavenan.idi.ntnu.no/amund/publications/2000/WebMiningWithILP.pdf

Personalization by Partial Evaluation—Ramakrishnan, Rossonwww.cs.vt.edu/TR/pipe-techreport.ps

Finding Relevant Litterature for Agent Research—Tveit (2000)cavenan.idi.ntnu.no/amund/publications/2000/AgentLitteratureSearch.pdf

Temporary User Modeling for Adaptive Product Presentations in the . . .—Joerding www.cs.usask.ca/UM99/Proc/DC/joerding.pdf

A Recipe Based On-Line Food Store—Svensson, Laaksolahti, Waern, Höök(2000) www.sics.se/^(˜)martins/publications/chi99.pdf

Individual Differences in Social Navigation—Höök, Laaksolahti, Svensson. . . (2000) www.sics.se/^(˜)martins/publications/chi00_efol.pdf

Matchmaking and Privacy in the Digital Library: Striking the . . .—Nichols, Twidale (1997)ftp.comp.lancs.ac.uk/pub/reports/1997/CSEG.4.97.pdf

Adaptive-FP: An Efficient And Effective Method For Multi-Level . . .—Mao (2001) fas.sfu.ca/pub/cs/theses/2001/RunyingMaoMSc.ps.gz

Classification and Clustering Study in Incomplete Data Domain.—Rodas,Gramajo www.lsi.upc.es/dept/techreps/ps/R01-11.pdf.gz

Modeling e-business with eBML—Lagha inforge.unil.ch/yp/Pub/01-cimre.pdf

Engineering an Ontology for a Multi-Agents Corporate MemorySystem—Acacia (2001)www-sop.inria.fr/acacia/personnel/Fabien.Gandon/research/ismick2001/article_fabien_gandon_ismick2001.pdf

A Rapidly Acquired Domain Model Derived from Markup Structure—UdoKruschwitz Department cswww.essex.ac.uk/staff/udo/papers/esslli.ps.gz

eBusiness Model Design, Classification and Measurements—Dubosson-Torbayinforge.unil.ch/yp/Pub/01-thunderbird.pdf

Beyond Document Similarity: Understanding . . . —Paepcke.www-db.stanford.edu/^(˜)cho/papers/info-filter.pdf

Lightweight Collaborative Filtering Method for . . . —Lightweight . . .www.research.ibm.com/dar/papers/pdf/weiss_pkdd01.pdf

Mechanisms For Coping With Unfair Ratings.—Chrysanthos . . . (2000)ccs.mit.edu/dell/icis2000.pdf

The MARS Adaptive Social Network for Information Access . . . —ResultsBin Yu www4ncsu.edu/^(˜)byu/papers/mars-experiments.pdf

An adaptive system for the personalized access to news—Ardissono,Console, Torre www.di.unito.it/^(˜)liliana/EC/aiComm01.pdf

Web Usage Mining for a Better Web-Based Learning Environment—Zaïane(2001) www.cs.ualberta.ca/^(˜)zaiane/postscript/CATE2001.pdf

Augmenting Recommender Systems by Embedding Interfaces . . . —AntoniettaGrasso . . . (1999)www.xrce.xerox.com/research/ct/publications/Documents/P10226/content/HICSS-33.ps

Extending Recommender Systems: A Multidimensional Approach—Adomavicius,Tuzhilin www.mineit.com/lc/ijcai/papers/adomavicius.pdf

MOVIES2GO—A new approach to online movie recommendation—Mukherjee,Dutta, Sen www.mineit.com/lc/ijcai/papers/mukherjee.pdf

Passive Profiling from Server Logs in an Online Recruitment . . . —Barrywww.mineit.com/lc/ijcai/papers/rafter.pdf

A Theoretical Analysis of Query Selection for Collaborative . . . —Lee,Long www.comp.nus.edu.sg/^(˜)leews/publications/colt01.ps

Experience in Ontology Engineering for a Multi-Agents Corporate . . .—Gandon (2001)www-sop.inria.fr/acacia/personnel/Fabien.Gandon/research/IJCAI2001/article_fabien_gandon_ijcai2001.ps

Agent-Mediators In Media-On-Demand Eletronic Commerce—Joo Paulo Andradewwwhome.cs.utwente.nl/^(˜)guizzard/mod-amec-cuba.pdf

Improving the Effectiveness of Collaborative Filtering . . . —Mobasher,Dai, Luo . . . www.mineit.com/lc/ijcai/papers/mobasher.pdf

www.inference.phy.cam.ac.uk/mackay/Bayes_FAQ.html

www-2.cs.cmu.edu/Groups/AI/html/faqs/ai/neural/faq.html

www.cs.stir.ac.uk/^(˜)lss/NNIntro/InvSlides.html

dir.yahoo.com/Science/Engineering/Electrical_Engineering/Neural_Networks/

www.aist.go.jp/NIBH/^(˜)b0616/Links.html

www.creative.net.au/^(˜)adrian/mirrors/neural/

www.fi.uib.no/Fysisk/Teori/NEURO/neurons.html

aass.oru.se/^(˜)tdt/ann/faq/FAQ.html

www.cis.hut.fi/^(˜)jari/research.html

www.eg3.com/WebID/elect/neur-net/blank/overview/a-z.htm

directory.google.com/Top/Computers/Artificial_Intelligence/Neural_Networks/

directory.google.com/top/computers/artificial_intelligence/neural_networks/faqs,_help,_and_tutorials/

dmoz.org/Computers/Artificial_Intelligence/Neural_Networks/

dmoz.org/Computers/Artificial_Intelligence/Neural_Networks/FAQs,_Help,_and_Tutorials/

www.cs.qub.ac.uk/^(˜)J.Campbell/myweb/book/nn.html

www.cere.pa.cnr.it/IDAschool/lectures/neural.html

cognet.mit.edu/MITECS/Entry/jordan2

www.faqs.org/faqs/ai-faq/neural-nets/part1/preamble.html

zhanshou.hypermart.net/thesis.htm

www.links999.net/hardware/neural.html

www-ra.informatik.uni-tuebingen.de/links/neuronal/welcome_e.html

www.cogneuro.ox.ac.uk/links/ann.html

faculty.cs.tamu.edu/choe/resources/

www.galaxy.com/galaxy/Engineering-and-Technology/Electrical-Engineering/Neural-Networks/

mu.dmt.ibaraki.ac.jp/yanai/neu/faq/

bubl.ac.uk/link/n/neuralnetworks.htm

www.webopedia.com/TERM/n/neural_network.html

www.ie.ncsu.edu/fangroup/neural.dir/indexneural.html

www.geneticprogramming.com/AI/nn.html

www.cs.utk.edu/^(˜)yarkhan/neural_networks.html

www.physiol.ox.ac.uk/^(˜)ket/nn.html

www.aaai.org/AITopics/html/neural.html

www.inference.phy.cam.ac.uk/mackay/itprnn/book.html

www.hh.se/staff/nicholas/NN_Links.html

xpidea.com/products/neurovcl/neuroabout.htm

www.msm.ele.tue.nl/research/neural/

homepages.goldsmiths.ac.uk/nikolaev/Nnets.htm

www.triumf.ca/project_ETA/neural_network.html

personal.bgsu.edu/^(˜)suny/nn.html

www.icmc.sc.usp.br/^(˜)andre/ann_links.html

www.stud.ntnu.no/^(˜)hirpa/links/AI_links.htm

it.umary.edu/Library/research/www_subjects/neural_networks.html

cindy.cis.nctu.edu.tw/NN/NN5/www.html

www.public.iastate.edu/^(˜)acl/links/links.html

www.cs.cf.ac.uk/User/O.F.Rana/neural.html

www.cs.unr.edu/^(˜)bebis/CS791S/

www.geocities.com/fastiland/NNwww.html

cns-web.bu.edu/pub/snorrason/bookmarks/neural.html

www.open.brain.riken.go.jp/^(˜)cao/index_work.html

svr-www.eng.cam.ac.uk/research/neural/other_neural_net_sites.html

See, U.S. Pat. Nos. 4,048,452; 4,737,983; 4,757,529; 4,893,301;4,953,204; 5,073,890; 5,278,898; 5,398,513; 5,369,695; 5,506,898;5,511,117; 5,519,773; 5,524,147; 5,590,188; 5,633,922; 5,633,924;5,715,307; 5,740,240; 5,768,360; 5,825,869; 5,848,143; 5,870,464;5,878,130; 5,901,214; 5,905,792; 5,907,608; 5,910,982; 5,915,011;5,917,903; 5,923,745; 5,926,539; 5,933,492; 5,940,496, 5,940,947;5,946,387; 5,953,332; 5,953,405; 5,956,397; 5,960,073; 5,963,632;5,970,134; 5,978,465; 5,982,868; 5,987,116; 5,987,118; 5,991,391;5,991,392; 5,991,395; 5,995,614; 5,995,615; 5,999,965; 6,002,760;6,005,931; 6,044,146; 6,058,435; 6,061,347; 6,064,667; 6,072,864;6,104,801; 6,115,462; 6,118,865; 6,122,358; 6,122,360; 6,122,364;6,128,380; 6,134,530; 6,147,975; 6,157,655; 6,175,563; 6,175,564;6,185,292; 6,223,165; 6,226,289; 6,229,888; 6,230,197; 6,233,332,6,333,979; 6,333,980; 6,347,139; and U.S. Patent Application Nos.010000458 A1; 0010024497 A1; 0020006191 A1; 0020009190 A1; 0020019846A1; and 0020021693 A1, each of which is expressly incorporated herein byreference.

Internet Auctions

On-line electronic auction systems which allow efficient sales ofproducts and services are well known, for example, EBAY.COM, ONSALE.COM,UBID.COM, and the like. Inverse auctions that allow efficient purchasesof product are also known, establishing a market price by competitionbetween sellers. The Internet holds the promise of further improvingefficiency of auctions by reducing transaction costs and freeing the“same time-same place” limitations of traditional auctions. This isespecially appropriate where the goods may be adequately described bytext or images, and thus a physical examination of the goods is notrequired prior to bidding.

In existing Internet systems, the technological focus has been inproviding an auction system that, over the course of hours to days,allow a large number of simultaneous auctions, between a large number ofbidders to occur. These systems must be scalable and have hightransaction throughput, while assuring database consistency and overallsystem reliability. Even so, certain users may selectively exploit knowntechnological limitations and artifacts of the auction system, includingnon-real time updating of bidding information, especially in the finalstages of an auction.

Because of existing bandwidth and technological hurdles, Internetauctions are quite different from live auctions with respect topsychological factors. Live auctions are of ten monitored closely bybidders, who strategically make bids, based not only on the “value” ofthe goods, but also on an assessment of the competition, timing,psychology, and progress of the auction. It is for this reason thatso-called proxy bidding, wherein the bidder creates a preprogrammed“strategy”, usually limited to a maximum price, are disfavored. Amaximum price proxy bidding system is somewhat inefficient, in thatother bidders may test the proxy, seeking to increase the bid price,without actually intending to purchase, or contrarily, after testing theproxy, a bidder might give up, even below a price he might have beenwilling to pay. Thus, the proxy imposes inefficiency in the system thateffectively increases the transaction cost.

In order to address a flurry of activity that of ten occurs at the endof an auction, an auction may be held open until no further bids arecleared for a period of time, even if advertised to end at a certaintime. This is common to both live and automated auctions. However, thislack of determinism may upset coordinated schedules, thus impairingefficient business use of the auction system.

In order to facilitate management of bids and bidding, some of theInternet auction sites have provided non-Hypertext Markup Language(HTML) browser based software “applet” to track auctions. For example,ONSALE.COM has made available a Marimba Castanet® applet called Bidwatchto track auction progress for particular items or classes of items, andto facilitate bidding thereon. This system, however, lacks real-timeperformance under many circumstances, having a stated refresh period of10 seconds, with a long latency for confirmation of a bid, due toconstraints on software execution, quality of service in communicationsstreams, and bid confirmation dialogue. Thus, it is possible to lose abid even if an attempt was made prior to another bidder. The need toquickly enter the bid, at risk of being too late, makes the processpotentially error prone.

Proxy bidding, as discussed above, is a known technique for overcomingthe constraints of Internet communications and client processinglimitations, since it bypasses the client and telecommunications linksand may execute solely on the host system or local thereto. However,proxy bidding undermines some of the efficiencies gained by a livemarket.

U.S. Pat. No. 5,890,138 to Godin, et al. (Mar. 30, 1999), expresslyincorporated herein by reference in its entirety, relates to an Internetauction system. The system implements a declining price auction process,removing a user from the auction process once an indication to purchasehas been received. See, Rockoff, T. E., Groves, M.; “Design of anInternet-based System for Remote Dutch Auctions”, Internet Research, v5, n 4, pp. 10-16, MCB University Press, Jan. 1, 1995.

A known computer site for auctioning a product on-line comprises atleast one web server computer designed for serving a host of computerbrowsers and providing the browsers with the capability to participatein various auctions, where each auction is of a single product, at aspecified time, with a specified number of the product available forsale. The web server cooperates with a separate database computer,separated from the web server computer by a firewall. The databasecomputer is accessible to the web computer server computer to allowselective retrieval of product information, which includes a productdescription, the quantity of the product to be auctioned, a start priceof the product, and an image of the product. The web server computerdisplays, updated during an auction, the current price of the product,the quantity of the product remaining available for purchase and themeasure of the time remaining in the auction. The current price isdecreased in a predetermined manner during the auction. Each user isprovided with an input instructing the system to purchase the product ata displayed current price, transmitting an identification and requiredfinancial authorization for the purchase of the product, which must beconfirmed within a predetermined time. In the known system, a certainfall-out rate in the actual purchase confirmation may be assumed, andtherefore some overselling allowed. Further, after a purchase isindicate, the user's screen is not updated, obscuring the ultimatelowest selling price from the user. However, if the user maintains asecond browser, he can continue to monitor the auction to determinewhether the product could have been purchased at a lower price, and ifso, fail to confirm the committed purchase and purchase the same goodsat a lower price while reserving the goods to avoid risk of loss. Thus,the system is flawed, and may fail to produce an efficient transactionor optimal price.

An Internet declining price auction system may provide the ability totrack the price demand curve, providing valuable marketing information.For example, in trying to determine the response at different prices,companies normally have to conduct market surveys. In contrast, with adeclining price auction, substantial information regarding price anddemand is immediately known. The relationship between participatingbidders and average purchasers can then be applied to provide aconventional price demand curve for the particular product.

U.S. Pat. No. 5,835,896, Fisher, et al., issued Nov. 10, 1998, expresslyincorporated herein by reference in its entirety, provides method andsystem for processing and transmitting electronic auction informationover the Internet, between a central transaction server system andremote bidder terminals. Those bids are recorded by the system and thebidders are updated with the current auction status information. Whenappropriate, the system closes the auction from further bidding andnotifies the winning bidders and losers as to the auction outcome. Thetransaction server posts information from a database describing a lotavailable for purchase, receives a plurality of bids, stored in a biddatabase, in response to the information, and automatically categorizesthe bids as successful or unsuccessful. Each bid is validated, and anelectronic mail message is sent informing the bidder of the bid status.This system employs HTTP, and thus does not automatically update remoteterminal screens, requiring the e-mail notification feature.

The auction rules may be flexible, for example including Dutch-typeauctions, for example by implementing a price markdown feature withscheduled price adjustments, and English-type (progressive) auctions,with price increases corresponding to successively higher bids. In theDutch type auction, the price markdown feature may be responsive tobidding activity over time, amount of bids received, and number of itemsbid for. Likewise, in the progressive auction, the award price may bedependent on the quantity desired, and typically implements a lowestsuccessful bid price rule. Bids that are below a preset maximum postedselling price are maintained in reserve by the system. If a certainsales volume is not achieved in a specified period of time, the price isreduced to liquidate demand above the price point, with the new pricebecoming the posted price. On the other hand, if a certain sales volumeis exceeded in a specified period of time, the system may automaticallyincrease the price. These automatic price changes allow the seller torespond quickly to market conditions while keeping the price of themerchandise as high as possible, to the seller's benefit. A “ProxyBidding” feature allows a bidder to place a bid for the maximum amountthey are willing to pay, keeping this value a secret, displaying onlythe amount necessary to win the item up to the amount of the currentlyhigh bids or proxy bids of other bidders. This feature allows bidders toparticipate in the electronic auction without revealing to the otherbidders the extent to which they are willing to increase their bids,while maintaining control of their maximum bid without closelymonitoring the bidding. The feature assures proxy bidders the lowestpossible price up to a specified maximum without requiring frequentinquiries as to the state of the bidding.

A “Floating Closing Time” feature may also be implemented whereby theauction for a particular item is automatically closed if no new bids arereceived within a predetermined time interval, assuming an increasingprice auction. Bidders thus have an incentive to place bidsexpeditiously, rather than waiting until near the anticipated close ofthe auction.

U.S. Pat. No. 5,905,975, Ausubel, issued May 18, 1999, expresslyincorporated herein by reference in its entirety, relates to computerimplemented methods and apparatus for auctions. The proposed systemprovides intelligent systems for the auctioneer and for the user. Theauctioneer's system contains information from a user system based on bidinformation entered by the user. With this information, the auctioneer'ssystem determines whether the auction can be concluded or not andappropriate messages are transmitted. At any point in the auction,bidders are provided the opportunity to submit not only their currentbids, but also to enter future bids, or bidding rules which may have theopportunity to become relevant at future times or prices, into theauction system's database. Participants may revise their executory bids,by entering updated bids. Thus, at one extreme, a bidder who wishes toeconomize on his time may choose to enter his entire set of biddingrules into the computerized system at the start of the auction,effectively treating this as a sealed-bid auction. At the oppositeextreme, a bidder who wishes to closely participate in the auction maychoose to constantly monitor the auction's progress and to submit all ofhis bids in real time. See also, U.S. patent application Ser. No.08/582,901 filed Jan. 4, 1996, which provides a method for auctioningmultiple, identical objects and close substitutes.

E-Commerce Systems

U.S. Pat. No. 5,946,669 (Polk, Aug. 31, 1999), expressly incorporatedherein by reference, relates to a method and apparatus for paymentprocessing using debit-based electronic funds transfer and disbursementprocessing using addendum-based electronic data interchange. Thisdisclosure describes a payment and disbursement system, wherein aninitiator authorizes a payment and disbursement to a collector and thecollector processes the payment and disbursement through an accumulatoragency. The accumulator agency processes the payment as a debit-basedtransaction and processes the disbursement as an addendum-basedtransaction. The processing of a debit-based transaction generallyoccurs by electronic funds transfer (EFT) or by financial electronicdata interchange (FEDI). The processing of an addendum-based transactiongenerally occurs by electronic data interchange (EDI).

U.S. Pat. No. 6,005,939 (Fortenberry, et al., Dec. 21, 1999), expresslyincorporated herein by reference, relates to a method and apparatus forstoring an Internet user's identity and access rights to World Wide Webresources. A method and apparatus for obtaining user information toconduct secure transactions on the Internet without having to re-enterthe information multiple times is described. The method and apparatuscan also provide a technique by which secured access to the data can beachieved over the Internet. A passport containing user-definedinformation at various security levels is stored in a secure serverapparatus, or passport agent, connected to computer network. A userprocess instructs the passport agent to release all or portions of thepassport to a recipient node and forwards a key to the recipient node tounlock the passport information.

U.S. Pat. No. 6,016,484 (Williams, et al., Jan. 18, 2000), expresslyincorporated herein by reference, relates to a system, method andapparatus for network electronic payment instrument and certification ofpayment and credit collection utilizing a payment. An electronicmonetary system provides for transactions utilizing anelectronic-monetary system that emulates a wallet or a purse that iscustomarily used for keeping money, credit cards and other forms ofpayment organized. Access to the instruments in the wallet or purse isrestricted by a password to avoid unauthorized payments. A certificateform must be completed in order to obtain an instrument. The certificateform obtains the information necessary for creating a certificategranting authority to utilize an instrument, a payment holder and acomplete electronic wallet. Electronic approval results in thegeneration of an electronic transaction to complete the order. If a userselects a particular certificate, a particular payment instrument holderwill be generated based on the selected certificate. In addition, theissuing agent for the certificate defines a default bitmap for theinstrument associated with a particular certificate, and the defaultbitmap will be displayed when the certificate definition is completed.Finally, the number associated with a particular certificate will beutilized to determine if a particular party can issue a certificate.

U.S. Pat. No. 6,029,150 (Kravitz, Feb. 22, 2000), expressly incorporatedherein by reference, relates to a system and method of payment in anelectronic payment system wherein a plurality of customers have accountswith an agent. A customer obtains an authenticated quote from a specificmerchant, the quote including a specification of goods and a paymentamount for those goods. The customer sends to the agent a singlecommunication including a request for payment of the payment amount tothe specific merchant and a unique identification of the customer. Theagent issues to the customer an authenticated payment advice based onlyon the single communication and secret shared between the customer andthe agent and status information, which the agent knows about themerchant, and/or the customer. The customer forwards a portion of thepayment advice to the specific merchant. The specific merchant providesthe goods to the customer in response to receiving the portion of thepayment advice.

U.S. Pat. No. 6,047,269 (Biffar, Apr. 4, 2000), expressly incorporatedherein by reference, relates to a self-contained payment system withcreating and facilitating transfer of circulating digital vouchersrepresenting value. A digital voucher has an identifying element and adynamic log. The identifying element includes information such as thetransferable value, a serial number and a digital signature. The dynamiclog records the movement of the voucher through the system andaccordingly grows over time. This allows the system operator to not onlyreconcile the vouchers before redeeming them, but also to recreate thehistory of movement of a voucher should an irregularity like a duplicatevoucher be detected. These vouchers are used within a self-containedsystem including a large number of remote devices that are linked to acentral system. The central system can e linked to an external system.The external system, as well as the remote devices, is connected to thecentral system by any one or a combination of networks. The networksmust be able to transport digital information, for example the Internet,cellular networks, telecommunication networks, cable networks orproprietary networks. Vouchers can also be transferred from one remotedevice to another remote device. These remote devices can communicatethrough a number of methods with each other. For example, for anon-face-to-face transaction the Internet is a choice, for aface-to-face or close proximity transactions tone signals or lightsignals are likely methods. In addition, at the time of a transaction adigital receipt can be created which will facilitate a fast replacementof vouchers stored in a lost remote device.

Micropayments

U.S. Pat. No. 5,999,919 (Jarecki, et al., Dec. 7, 1999), expresslyincorporated herein by reference, relates to an efficient micropaymentsystem. Existing software proposals for electronic payments can bedivided into “on-line” schemes which require participation of a trustedparty (the bank) in every transaction and are secure againstoverspending, and “off-line” schemes which do not require a third partyand guarantee only that overspending is detected when vendors submittheir transaction records to the bank (usually at the end of the day). Anew “hybrid” scheme is proposed which combines the advantages of both“on-line” and “off-line” electronic payment schemes. It allows forcontrol of overspending at a cost of only a modest increase incommunication compared to the off-line schemes. The protocol is based onprobabilistic polling. During each transaction, with some smallprobability, the vendor forwards information about this transaction tothe bank. This enables the bank to maintain an accurate approximation ofa customer's spending. The frequency of polling messages is related tothe monetary value of transactions and the amount of overspending thebank is willing to risk. For transactions of high monetary value, thecost of polling approaches that of the on-line schemes, but formicropayments, the cost of polling is a small increase over the trafficincurred by the off-line schemes.

Micropayments are often preferred where the amount of the transactiondoes not justify the costs of complete financial security. In themicropayment scheme, typically a direct communication between creditorand debtor is not required; rather, the transaction produces a resultwhich eventually results in an economic transfer, but which may remainoutstanding subsequent to transfer of the underlying goods or services.The theory underlying this micropayment scheme is that the monetaryunits are small enough such that risks of failure in transaction closureis relatively insignificant for both parties, but that a user gets fewchances to default before credit is withdrawn. On the other hand, thetransaction costs of a non-real time transactions of small monetaryunits are substantially less than those of secure, unlimited orpotentially high value, real time verified transactions, allowing andfacilitating such types of commerce. Thus, the rights management systemmay employ applets local to the client system, which communicate withother applets and/or the server and/or a vendor/rights-holder tovalidate a transaction, at low transactional costs.

The following U.S. Patents, expressly incorporated herein by reference,define aspects of micropayment, digital certificate, and on-line paymentsystems: U.S. Pat. No. 5,930,777 (Barber, Jul. 27, 1999, Method ofcharging for pay-per-access information over a network); U.S. Pat. No.5,857,023 (Jan. 5, 1999, Demers et al., Space efficient method ofredeeming electronic payments); U.S. Pat. No. 5,815,657 (Sep. 29, 1998,Williams, System, method and article of manufacture for networkelectronic authorization utilizing an authorization instrument); U.S.Pat. No. 5,793,858 (Aug. 11, 1998, Micali, Certificate revocationsystem), U.S. Pat. No. 5,717,757 (Feb. 10, 1998, Micali, Certificateissue lists); U.S. Pat. No. 5,666,416 (Sep. 9, 1997, Micali, Certificaterevocation system); U.S. Pat. No. 5,677,955 (Doggett et al., Electronicfunds transfer instruments); U.S. Pat. No. 5,839,119 (Nov. 17, 1998,Krsul; et al., Method of electronic payments that preventsdouble-spending); U.S. Pat. No. 5,915,093 (Berlin et al.); U.S. Pat. No.5,937,394 (Wong, et al.); U.S. Pat. No. 5,933,498 (Schneck et al.); U.S.Pat. No. 5,903,880 (Biffar); U.S. Pat. No. 5,903,651 (Kocher); U.S. Pat.No. 5,884,277 (Khosla); U.S. Pat. No. 5,960,083 (Sep. 28, 1999, Micali,Certificate revocation system); U.S. Pat. No. 5,963,924 (Oct. 5, 1999,Williams et al., System, method and article of manufacture for the useof payment instrument holders and payment instruments in networkelectronic commerce); U.S. Pat. No. 5,996,076 (Rowney et al., System,method and article of manufacture for secure digital certification ofelectronic commerce); U.S. Pat. No. 6,016,484 (Jan. 18, 2000, Williamset al., System, method and article of manufacture for network electronicpayment instrument and certification of payment and credit collectionutilizing a payment); U.S. Pat. No. 6,018,724 (Arent); U.S. Pat. No.6,021,202 (Anderson et al., Method and system for processing electronicdocuments); U.S. Pat. No. 6,035,402 (Vaeth et al.); U.S. Pat. No.6,049,786 (Smorodinsky); U.S. Pat. No. 6,049,787 (Takahashi, et al.);U.S. Pat. No. 6,058,381 (Nelson, Many-to-many payments system fornetwork content materials); U.S. Pat. No. 6,061,448 (Smith, et al.);U.S. Pat. No. 5,987,132 (Nov. 16, 1999, Rowney, System, method andarticle of manufacture for conditionally accepting a payment methodutilizing an extensible, flexible architecture); U.S. Pat. No. 6,057,872(Candelore); and U.S. Pat. No. 6,061,665 (May 9, 2000, Bahreman, System,method and article of manufacture for dynamic negotiation of a networkpayment framework). See also, Rivest and Shamir, “PayWord and MicroMint:Two Simple Micropayment Schemes” (May 7, 1996); Micro PAYMENT transferProtocol (MPTP) Version 0.1 (22-Nov.-95) et seq.,www.w3.org/pub/WWW/TR/WD-mptp; Common Markup for web MicropaymentSystems, www.w3.org/TR/WD-Micropayment-Markup (9-Jun.-99); “DistributingIntellectual Property: a Model of Microtransaction Based Upon Metadataand Digital Signatures”, Olivia, Maurizio,olivia.modlang.denison.edu/^(˜)olivia/RFC/09/, all of which areexpressly incorporated herein by reference.

See, also: U.S. Pat. No. 4,977,595; 5,224,162; 5,237,159; 5,392,353;5,511,121; 5,621,201; 5,623,547; 5,679,940; 5,696,908; 5,754,939;5,768,385; 5,799,087; 5,812,668; 5,828,840; 5,832,089; 5,850,446;5,889,862; 5,889,863; 5,898,154; 5,901,229; 5,920,629; 5,926,548;5,943,424; 5,949,045; 5,952,638; 5,963,648; 5,978,840; 5,983,208;5,987,140; 6,002,767; 6,003,765; 6,021,399; 6,026,379; 6,029,150;6,029,151; 6,047,067; 6,047,887; 6,055,508; 6,065,675; 6,072,870, eachof which is expressly incorporated herein by reference.

-   Game Theory    GEB: Games and Economic Behavior    EMA: Econometrica    JET: Journal of Economic Theory    IJGT: International Journal of Game Theory    AER: American Economic Review    QJE: Quarterly Journal of Economics    JPE: Journal of Political Economy    REStud: Review of Economic Studies-   Description of Games    Roger Myerson, Nash Equilibrium and the History of Economic Theory.    JEL 1999-   Rationality, Dominance, Weak Dominance etc    Douglas Bernheim, Rationalizable strategic behavior. EMA 1984    David Pearce, Rationalizable strategic behavior and the problem of    perfection. EMA 1984    Douglas Bernheim, Axiomatic characterization of rational choice in    strategic enviroments. Scand. J. of E. 1986    Shimoji and Watson, Conditional Dominance, rationalizability and    game forms. JET 1998    David Roth, Rationalizable predatory pricing. JET 1996    Basu and Weibul, strategy subsets closed under rational behavior. E.    Letters 1991    Larry Samuelson, Dominated strategies and common knowledge. GEB 1992    Marx and Swinkels, Order independence for iterated weak dominance.    GEB 1997-   Equilibrium: Nash, Refinements, Correlated    Selten, Reexamination of the Perfectness concept for equilibrium    points in extensive form games. IJGT 1975.    Myerson, Refinements of the Nash equilibrium concept. IJGT 1975.    Kalai and Samet, Persistent equilibria in strategic games. IJGT    1984.    Kohlberg and Mertens, On the strategic stability of Equilibria.    Econometrica, 1986.    Aumann, Correlated equilibria as an expression of baysian    rationality. Econometrica, 1987.    Aumann and Brandenberger, Espitemic conditions for equilibrium. EMA    1995    Hal Varian, A model of Sales. AER 1980-   The Extensive Form Games with Perfect Information    Rubinstein, On the interpretation of game theory. Econometrica 1991    Reny, Common beleifs and the theory of games with perfect    information. JET 1993.    Aumann Backward induction and common knowledge of rationality. GEB    1995    Binmore, A note on backward induction: Aumann, Reply to Binmore. GEB    1996    Selten, A Reexamination of the perfectness . . .-   Hyperbolic Discounting    O'Donoghue and Rabin, Doing it now or doing it later. AER 1999    David Laibson, Golden Eggs and Hyperbolic Discounting. QJE 1997-   The Economics of Altruism    Gary Becker, A theory of social interactions. JPE 1974    Ted Bergstrom, A fresh look at the rotten kid theorem and other    household mysteries. JPE 1989    Bernheim and Stark, Altruism within the family reconsidered: do nice    guys finish last. AER 1988    Lindbeck and Weibull, Altruism and time consistency: the economics    of fait accompli. JPE 1988    Bruce and Waldman, Transfers in kind: why they can be efficient and    non-paternalistic. AER 1991    Jack Robles, Paternal altruism or smart parent altruism? CUWP 98-10    Mathew Rabin, Incorperating fairness into economics and game theory.    AER 1993    Ray and Ueda, Egalitarianism and incentives. JET 1996    Bernheim, Shleifer adn Summers, The strategic bequest motive. JPE    1985-   Extensive Form Games Without Perfect Information    Kreps and Wilson, Sequential Equilibrium. Econometrica, 1983.    Van Damme, Stable Equilibria and forward induction. JET 1989.-   Strategic Information Transmision    Crawford and Sobel, Strategic information transmission. Econometrica    1982.    Cho and Kreps, Signalling games and stable equilibria. QJE 1987    Mailath, Okuno-Fujiwara and Postlewaite, Beleif based refinements in    signalling games. JET 1993    Milgrom and Roberts, Limit pricing and entry under incomplete    information: an equilibrium analysis. EMA 1982 (pages 443-459)    Cho and Sobel, Strategic Stability and uniqueness in signalling    games. JET 1990.    Farrell, Meaning and credibility in cheap talk games. GEB    Milgrom & Roberts, Limit pricing and entry under incomplete    information, an equilibrium anal., EMA 1982    Milgrom, Good news and bad news, representation and applications,    Rand.-   Folk Theorems for Repeated Games    Dilip Abreu. On the theory of infinitely repeated games with    Discounting. Econometrica 1988    Benoit and Krishna. Finitely Repeated games. Econometrica, 1985.    James Friedman. A noncooperative equilibrium for supergames. REStud    1971.    James Friedman. Cooperative equilibria in finite horizon supergames.    JET 1985.    Fudenberg and Maskins. The Folk Theorem in repeated games with    discounting or with incomplete information. Econometrica 1986.    Roy Radner. Collusive Behavior in non-cooperative epsilon equilibria    in oligopolies with long but finite lives. JET 1980.    Ariel Rubinstein. Equilibrium in supergames with the overtaking    criterion. JET 1977.-   Renegotiation    Benoit and Krisna, Renegotiation in finitely repeated games. EMA    1993    Bergin and MacCleod, Efficiency adn renegotiation in repeated games.    JET 1993    Andreas Blume, Interplay communication in repeated games. GEB 1994    Geir Asheim, Extending renegotiation proofness to infinite horizon    games. GEB 1991    Bernheim and Ray, Collective dynamic consistency in repeated games.    GEB 1989    Farrel and Maskin, Renegotiation in Repeated Games. GEB 1989-   Cooperative Game Theory    Freidman, Game theory with applications to economics chapter 6 and 7    Nash, The Bargaining problem. EMA 1950    Kalai and Smordinski, Other Solutions to Nash's problem. EMA 1975-   Noncooperative Bargaining    Rubinstein, Perfect equiibrium in a bargaining model. EMA 1982    Joel Watson, Alternating offer bargaining with two sided incomplete    information. REStud 1999-   Reputation    Kreps, Milgrom, Roberts and Wilson, Reputation and imperfect    information: predation, reputation and entry deterence: rational    cooperation in the finitely repeated prisoner's dilemna. JET 1981    Aumann and Sorin, Cooperation and Bounded recal. GEB 1989    Klaus Schmidt, Reputation and equilibrium characterization in    repeated games with conflicting interests, Econometrica 1993,    325-352    Cripps and Thomas, Reputation and Commitment in Two person games    without discounting, EMA, 1995, 1401-1420    Joel Watson, A reputation refinement withough equilibrium, EMA 1993,    199-206    Celentani, Fudenberg and Levine, Maintaining a reputation against a    long lived opponent EMA 1996, 691-704-   Evolutionary Game Theory    Vince Crawford, An Evolutionary interpretation of VHBB's    experimental results on coordination. GEB 1991    Gilboa and Matsui, Social Stability and Equilibrium, EMA 1991    Kandori, Mailath and Rob, Learning, Mutation, and Long Run    Equilibria in games, EMA 1993.    Peyton Young, An Evolutionary Model of Bargaining, JET 1993    Peyton Young, The Evolution of Conventions, EMA 1993    Larry Samuelson, Stochastic Stability with alternative best replies.    JET    Noldeke and Samuelson, The Evolution of Backwards and Forwards    Induction, GEB 1993    Jack Robles, An Evolutionary Folk Theorem For Finitely Repeated    Games CU WP 99-    Kim and Sobel, An Evolutionary Approach to Preplay Communication EMA    1995-   General Game Theory    Bierman H. S. & Fernandez L., Game Theory with Economic    Applications, Addison-Wesley, 1993.    Dixit A., & Nalebuff B., Thinking Strategically: the Competitive    Edge in Business, Politics, and Everyday Life, New York: Norton,    1991.    McMillan J., Games, Strategies, and Managers, Oxford: OUP, 1992.    Baird D. G., Gertner R. H., and Picker R. C., Game Theory and the    Law, Harvard U.P., 1994.    Rasmusen E., Games and Information: An Introduction to Game Theory,    Oxford: B. Blackwell, 2nd ed., 1994.    Ghemawat P., Games Businesses Play: Cases and Models, New York:    Wiley, 1995.    Gardner R, Games for Business and Economics, New York: Wiley, 1995.-   Strategic Decision Making    Dixit & Nalebuff, Intro; Ch2 Anticipating your rival's response; Ch3    Seeing through your rival's response.    Barnett, F. W. Making game theory work in practice, Wall Street    Journal, 1995.    Bierman & Fernandez, Ch5 Nash equilibrium I, Ch11 Nash equilibrium    II    O'Neill B., International escalation and the dollar auction, Journal    of Conflict Resolution, 1986.    Schelling T. C., Ch7 Hockey helmets, daylight saving, and other    binary choices, in his Micromotives and Macrobehavior, NY: Norton,    1978.    Marks R. E., Competition and common property, 1998.    McMillan J., Ch3 Understanding cooperation and conflict.    McAfee R. P. & J. McMillan, Competition and game theory, Journal of    Marketing Research, 1996.    Baird, Gertner, & Picker, Ch1 Simultaneous decision-making and the    normal form game.    Gardner, Ch1 Introduction, Ch2 Two-person games, Ch16 Voting games.    Rasmusen, Ch1 The rules of the game.    Schelling T. C., What is game theory? in his Choice and Consequence:    Perspectives of an Errant Economist, Camb.: Harvard UP, 1980.-   Decision Analysis—Games Against Nature    Apocalpse maybe, and An insurer's worst nightmare, The Economist,    1995/96    Bierman & Fernandez, Chs 1-3.    Ulvila J. W. & R. Brown, Decision analysis comes of age, Harvard    Business Review 1982.    Howard R. A., Decision analysis: practice and promise, Management    Science, 1988.    Clemen R. T., Making Hard Decisions: An Introduction to Decision    Analysis, Belmont, Calif.: Duxbury, 1996.    Samson D., Chs 2-6, 11, Managerial Decision Analysis, Chicago: R. D.    Irwin, 1988.-   Strategic Moves    Dixit & Nalebuff, Ch5 Strategic moves.    Brams S. J. & J. M. Togman, Cooperation through threats: the    Northern Ireland case, PS: Political Science & Politics, March 1998.    Gardner, Ch4 n-person games, Ch5 Non-cooperative games.    Colman A. M., Ch8 Multi-person games: social dilemmas, in his Game    Theory and Experimental Games, Oxford: Pergamon, 1982.    Kay J., Ch3 Co-operation and Co-ordination, in his Foundations of    Corporate Success: How Business Strategies Add Value, Oxford: OUP,    1993.    Brams S. J., Ch1 International relations games, in Game Theory and    Politics, NY: Macmillan, 1975.-   Credible Commitment    Dixit & Nalebuff, Ch6 Credible commitments.    Bierman & Fernandez, Ch23 Subgame-perfect equilibrium    Rasmusen, Ch4.1 Subgame perfection.    Gardner, Ch6 Credibility and subgame perfection.    Ghemawat, Ch3 Preemptive capacity expansion in the titanium dioxide    industry.-   Repetition and Reputation    Dixit & Nalebuff, Ch4 Resolving the Prisoner's Dilemma; Ch9    Cooperation and coordination.    Nowak, M., R. May, & K. Sigmund, The arithmetic of mutual help,    Scientific American, 1995    Hofstadter D., Ch29 The Prisoner's Dilemma computer tournaments and    the evolution of cooperation, in his Metamagical Themas, Penguin,    1985.    Marks R. E., Midgley F D. F., & Cooper L. G., Adaptive behaviour in    an oligopoly, in Evolutionary Algorithms in Management Applications,    ed. by J. Biethahn & V. Nissen, (Berlin: Springer-Verlag), 1995.    Baird Gertner & Picker, Ch2 Dynamic interaction and the    extensive-form game, Ch5 Reputation and repeated games.    Gardner, Ch7 Repeated games, Ch8 Evolutionary stability and bounded    rationality.    Rasmusen, Ch4 Dynamic games and symmetric information, Ch5    Reputation and repeated games with symmetric information.-   Unpredictability    Dixit & Nalebuff, Ch7 Unpredictability; Ch8 Brinkmanship.    Bierman & Fernandez, Ch11.9    Gardner, Ch3 Mixed strategies.    Rasmusen, Ch3 Mixed and continuous strategies.-   Bargaining    Dixit & Nalebuff, Ch10 The voting strategy; Chit Bargaining.    McMillan, Ch5 Gaining bargaining power; Ch6 Using information    strategically.    Elster J., Ch14 Bargaining, in Nuts and Bolts for the Social    Sciences, Camb.: CUP, 1989    Murnighan J. K., Game's End, Chapter 15 in his: Bargaining Games: A    New Approach to Strategic Thinking in Negotiations, NY: William    Morrow, 1992.    Bierman & Fernandez, Ch6 Bargaining.    Schelling T. C., Ch2 Essay on bargaining, in The Strategy of    Conflict, Camb.: Harvard UP, 1980.    Baird Gertner & Picker, Ch7 Noncooperative bargaining    Gardner, Ch12 Two-person bargains. Ch14 n-person bargaining and the    core.    Rasmusen, Ch11 Bargaining.    Brams S. J., Negotiation Games: Applying Game Theory to Bargaining    and Arbitration, NY: Routledge, 1990.-   Using Information Strategically    McMillan, Ch6 Using information strategically    Bierman & Fernandez, Ch17 Bayesian equilibrium, Ch19 Adverse    selection and credit rationing    Rasmusen, Ch2 Information P-13    Baird Gertner & Picker, Ch4 Signalling, screening, and nonverifiable    information    Gardner, Ch9 Signaling games.-   Bidding in Competition    Revenge of the nerds, It's only a game, and Learning to play the    game, The Economist, 1994    Landsburg S. E., Cursed winners and glum losers, Ch18 of his The    Armchair Economist: Economics and Everyday Life, New York: The Free    Press, 1993.    Norton, R., Winning the game of business, Fortune, 1995,    Koselka, R., Playing poker with Craig McCaw, Forbes, 1995,    Dixit & Nalebuff, Ch12 Incentives.    McMillan, Ch11 Bidding in competition    McAfee R. P. & J. McMillan, Analyzing the airwaves auction, Journal    of Economic Perspectives, 1996    R. Marks, Closed tender vs. open bidding auctions, 22 Dec. 1994.    The Economist, Secrets and the prize, 12 Oct. 1996, p. 98.    Scientific American, Making honesty pay, January 1997, p. 13.    Gardner, Ch11 Auctions.    Brams S. J. & A. D. Taylor, Fair division by auctions, Ch9 of their    Fair Division: From Cake-Cutting to Dispute Resolution, Cambridge:    CUP, 1996.    Rasmusen, Ch12 Auctions.-   Contracting, or the Rules of the Game    Kay, Ch4 Relationships and contracts.    Dixit & Nalebuff, Ch12 Incentives.    McMillan, Ch8 Creating incentives; Ch9 Designing contracts; Ch10    Setting executives' salaries.    Williamson O. E., Strategizing, economizing, and economic    organization, Strategic Mgt Journal, 1991.    Bierman & Fernandez, Ch7 Involuntary unemployment.    Gardner, Ch10 Games between a principal and an agent.    Milgrom P. & Roberts J., Ch5 Bounded rationality and private    information; Ch6 Moral hazard and performance incentives. Economics,    Organization and Management, Englewood Cliffs: Prentice-Hall, 1992.-   Choosing the Right Game: Co-opetition    Brandenburger A. M. & B. J. Nalebuff, The right game: using Game    Theory to shape strategy, HarvBusRev1995    mayet.som.yale.edu/coopetition/index2.html    Koselka R., Businessman's dilemma, and Evolutionary economics: nice    guys don't finish last, Forbes, Nov. 11, 1993.    Brandenburger A. M. & B. J. Nalebuff, Co-opetition: 1. A    revolutionary mindset that combines competition and cooperation; 2.    The Game Theory Strategy that's changing the game of business. New    York: Currency Doubleday, 1996.    Brandenburger A. M. & Harborne W. S. Jr., Value-based business    strategy, Journal of Economics and Management Strategy, 5(1), 1996.    Baird Gertner & Picker, Ch6 Collective action, embedded games, and    the limits of simple models.    Morrow J. D., Game Theory for Political Scientists, Princeton:    P.U.P., 1994.    Casson M., The Economics of Business Culture: Game Theory,    Transaction Costs and Economic Performance, Oxford: OUP, 1991.    Schelling T. C., Altruism, meanness, and other potentially strategic    behaviors, American Economic Review, 68(2): 229-231, May 1978.    Crawford V. P., Thomas Schelling and the analysis of strategic    behavior, in Strategy and Choice, ed. by R. J. Zeckhauser, MIT    Press, 1991.    For a history of game theory since Old Testament times, point your    browser at the following URL: www.canterbury.ac.nz/econ/hist.htm-   For Further Surfing on the 'Net About Game Theory, Start at the    Following URLs:    www.pitt.edu/^(˜)alroth/alroth.html    Eddie Dekel, Drew Fudenberg and David K. Levine, Learning to Play    Bayesian Games (Jun. 20, 2001).    www.gametheory.net/html/lectures.html    Drew Fudenberg and David K. Levine, The Nash Threats Folk Theorem    With Communication and Approximate Common Knowledge in Two Player    Games (Jun. 10, 2002).    See also, U.S. Pat. Nos. 6,243,684; 6,230,197; 6,229,888; 6,226,360;    6,226,287; 6,212,178; 6,208,970; 6,205,207; 6,201,950; 6,192,413;    6,192,121; 6,185,283; 6,178,240; 6,173,052; 6,170,011; RE37,001;    6,157,711; 6,154,535; 6,154,528; 6,151,387; 6,148,065; 6,144,737;    6,137,870; 6,137,862; 6,134,530; 6,130,937; 6,128,376; 6,125,178;    6,122,484; 6,122,364; 6,122,358; 6,115,693; 6,102,970; 6,098,069;    6,097,806; 6,084,94; 6,070,142; 6,067,348; 6,064,973; 6,064,731;    6,064,730; 6,058,435; 6,055,307; 6,052,453; 6,049,599; 6,044,368;    6,044,149; 6,044,135; 6,041,118; 6,041,116; 6,035,021; 6,031,899;    6,026,156; 6,026,149; 6,021,428; 6,021,190; 6,021,114; 6,018,579;    6,016,344; 6,014,439; 6,011,845; 6,009,149; 6,005,928; 6,005,534;    6,002,760; 5,995,948; RE36,416; 5,991,761; 5,991,604; 5,991,393;    5,987,116; 5,987,115; 5,982,857; 5,978,471; 5,978,467; 5,978,465;    5,974,135; 5,974,120; 5,970,132; 5,966,429; 5,963,635; 5,956,392;    5,949,863; 5,949,854; 5,949,852; 5,946,394; 5,946,388; 5,943,403;    5,940,813; 5,940,497; 5,940,493; 5,937,390; 5,937,055; 5,933,480;    5,930,339; 5,926,528; 5,924,016; 5,923,746; 5,918,213; 5,917,893;    5,914,951; 5,913,195; 5,912,947; 5,907,601; 5,905,979; 5,903,641;    5,901,209; 5,898,762; 5,898,759; 5,896,446; 5,894,505; 5,893,902;    5,878,126; 5,872,833; 5,867,572; 5,867,564; 5,867,559; 5,857,013;    5,854,832; 5,850,428; 5,848,143; 5,841,852; 5,838,779; 5,838,772;    5,835,572; 5,828,734; 5,828,731; 5,825,869; 5,822,410; 5,822,401;    5,822,400; 5,815,566; 5,815,554; 5,815,551; 5,812,642; 5,806,071;    5,799,077; 5,796,816; 5,796,791; 5,793,846; 5,787,159; 5,787,156;    5,774,537; 5,768,355; 5,761,285; 5,748,711; 5,742,675; 5,740,233;    RE35,758; 5,729,600; 5,727,154; 5,724,418; 5,717,741; 5,703,935;    5,701,295; 5,699,418; 5,696,818; 5,696,809; 5,692,034; 5,692,033;    5,687,225; 5,684,863; 5,675,637; 5,661,283; 5,657,074; 5,655,014;    5,655,013; 5,652,788; 5,646,988; 5,646,986; 5,638,436; 5,636,268;    5,636,267; 5,633,917; 5,625,682; 5,625,676; 5,619,557; 5,610,978;    5,610,774; 5,600,710; 5,594,791; 5,594,790; 5,592,543; 5,590,171;    5,588,049; 5,586,179; 5,581,607; 5,581,604; 5,581,602; 5,579,383;    5,579,377; 5,577,112; 5,574,784; 5,572,586; 5,572,576; 5,570,419;    5,568,540; 5,561,711; 5,559,878; 5,559,867; 5,557,668; 5,555,295;    5,555,290; 5,546,456; 5,546,452; 5,544,232; 5,544,220; 5,537,470;    5,535,257; 5,533,109; 5,533,107; 5,533,103; 5,530,931; 5,528,666;    5,526,417; 5,524,140; 5,519,773; 5,517,566; 5,515,421; 5,511,112;    5,506,898; 5,502,762; 5,495,528; 5,495,523; 5,493,690; 5,485,506;    5,481,596; 5,479,501; 5,479,487; 5,467,391; 5,465,286; 5,459,781;    5,448,631; 5,448,624; 5,442,693; 5,436,967; 5,434,906; 5,432,835;    5,430,792; 5,425,093; 5,420,919; 5,420,852; 5,402,474; 5,400,393;    5,390,236; 5,381,470; 5,365,575; 5,359,645; 5,351,285; 5,341,414;    5,341,412; 5,333,190; 5,329,579; 5,327,490; 5,321,745; 5,319,703;    5,313,516; 5,311,577; 5,311,574; 5,309,505; 5,309,504; 5,297,195;    5,297,146; 5,289,530; 5,283,818; 5,276,732; 5,253,289; 5,251,252;    5,239,574; 5,224,153; 5,218,635; 5,214,688; 5,185,786; 5,168,517;    5,166,974; 5,164,981; 5,163,087; 5,163,083; 5,161,181; 5,128,984;    5,121,422; 5,103,449; 5,097,528; 5,081,711; 5,077,789; 5,073,929;    5,070,526; 5,070,525; 5,063,522; 5,048,075; 5,040,208; 5,020,097;    5,020,095; 5,016,270; 5,014,298; 5,007,078; 5,007,000; 4,998,272;    4,987,587; 4,979,171; 4,975,841; 4,958,371; 4,941,168; 4,935,956;    4,933,964; 4,930,150; 4,924,501; 4,894,857; 4,878,243; 4,866,754;    4,852,149; 4,807,279; 4,797,911; 4,768,221; 4,677,663; 4,286,118

SUMMARY AND OBJECTS OF THE INVENTION

The summary description of the invention herein provides disclosure of anumber of embodiments of the invention. Language describing oneembodiment or set of embodiments is not intended to, and does not, limitor constrain the scope of other embodiments of the invention.

The present invention provides a system and method for intelligentcommunication routing within a low-level communication server system.Therefore, it allows replacement or supplementation of telephonenumbers, IP addresses, e-mail addresses and the like, to identifytargets accessible by the system with high-level definitions, which arecontextually interpreted at the time of communications routing, toappropriately direct the communication. Therefore, the target of acommunication is defined by an algorithm, rather than a predeterminedaddress or simple rule, and the algorithm evaluated in real time forresolution of the target, to deliver the communication or establish areal or virtual channel.

Alternately, the intelligence of the server may be used to implementtelephony or computer-telephony integration features, other thandestination or target.

Therefore, according to the present invention, communications are, ormay be, routed or other telecommunications features implemented,inferentially or intelligently, at a relatively low level within thecommunications management architecture. For example, in a call center,the software system which handles virtual or real circuit switching andmanagement resolves the destination using an algorithm or the like,rather than an unambiguous target.

An embodiment according to the present invention, the control overswitching in a circuit switch is partitioned together with intelligentfunctions.

Intelligent functions include, for example, but are not limited to,optimizations, artificial neural network implementation, probabilisticand stochastic process calculations, fuzzy logic, Baysian logic andhierachal Markov models (HMMs), or the like.

A particularly preferred embodiment provides a skill-based callautomatic call director for routing an incoming call in a call center toan appropriate or optimal agent. While skill-based routing technologiesare known in the art, the intelligence for routing the call is separatefrom the voice routing call management system. Thus, the prior artprovides a separate and distinct process, and generally a separatesystem or partition of a system, for evaluation of the skill basedrouting functionality. For example, while the low level voice channelswitching is performed in a PBX, the high level policy management is often performed in a separate computer system, linked to the PBX through apacket switched network and/or bus data link.

The present invention, however, integrates evaluation of intelligentaspects of the control algorithm with the communications management.This integration therefore allows communications to be established basedon an inferential description of a target, rather than a concretedescription, and allows a plurality of considerations to be applied,rather than a single unambiguous decision rule.

An aspect of the present invention therefore proposes an architecturalchange in the computer telephony integrated (CTI) systems, wherein theCTI host takes on greater responsibilities, for example intelligenttasks, than in known systems. In this case, the host is, for example, aPC server having a main processor, for example one or more Intel Pentium4 Xeon or AMD Athlon MP processors, and one or more voice channelprocessors, such as Dialogic D/320-PCI or D/160SC/LS, or PrimeNet MMPCI, or the like. In this type of system, the voice channel processorhandles connections and switching, but does not implement control. Thecontrol information is provided by the main processor over, for example,a PCI bus, although some or all control information may also be relayedover a mezzanine bus. Because the actual voice channel processing is offloaded from the main processor, real time response with respect to voiceinformation is not required. Therefore, the main processor may operateand be controlled by a standard operating system, in contrast to a realtime operating system. While the control processor does operate undercertain latency constraints, these are quite long as compared to theresponse latency required of the voice channel processors. This, inturn, allows the main processor(s) to undertake a plurality of taskswhich are not deterministic, that is, the time required to completeprocessing of a task is unknown and is not necessarily completed withina time window. However, by using state of the art processors, such as a3.06 GHz Pentium processor, the amount of processing which may beundertaken, meeting a reasonable expectation of processing latency, issubstantial. Thus, operating under the same instance of the operatingsystem, for example sharing the same message queue, as the interfacebetween the main processor and the voice channel processor(s), thesystem according to the present invention may process advanced andcomplex algorithms for implementing intelligent control. Thisarchitecture reduces the required bandwidth for communications with anexternal high level management system, as well as the processing loadthereon. Likewise, since significant decisions and resource allocationsare made within the switching system, the need for high quality ofservice communications channels between the switching system andmanagement system is also reduced.

Preferably, the intelligent algorithm for controlling the voice channelsrequires minimal access to a disk or mass-storage based database. Thatis, for any transaction to be processed, preferably either allinformation is available to the main processor at the commencement ofthe process, or an initial request is made at commencement of theprocess, with no additional requests necessary to complete the process,although a stored database may be updated at the conclusion of theprocess. For example, as a call is received, sufficient information isgathered to define the caller, either by identity or characteristics.This definition may then trigger an initial database lookup, for exampleto recall a user transaction file or a user profile. Preferably,therefore, a table or other data structure is stored in low-latencymemory, for example, double data rate dynamic random access memory(DDR-RAM), which holds the principal parameters and informationnecessary for execution of the algorithm. Therefore, preferably agentand system status information is present and maintained locally, andneed not be recalled for each transaction.

According to a preferred embodiment of the invention, a process isprovided for optimizing the selection of an agent within the voicechannel switching system. This process is a multistep process. Only thelater part of the process generally need be completed in a time-criticalfashion, e.g., as a foreground task. The initial part(s) of the processmay be implemented over an extended period of time, so long as the dataavailable for transactions is sufficient current to avoid significanterrors.

First, a set of skills are defined, which are generally independentskills, although high cross correlations between skills would not defeatthe utility thereof. The skill definitions may be quite persistent, forexample over a particular campaign, call center, or even multiple callcenters and multiple campaigns. The skills generally are not subject tochange after being defined, although through advanced processing orreprocessing of data, clusters in multidimensional space may be definedor revised, representing “skills”. Likewise, a manual process may beemployed to define the skill set.

Next, for any given task, the skills are weighted. That is, theimportance of any skill with respect to the task is defined orpredicted. This may also be a manual or automated process. In the caseof an automated process for weighting the skills, past tasks similar innature are analyzed to determine which skills were involved, and to whatextent. Typically, since the skill set definitions are normative, thetask-skill relationships are derived from data for various or allagents, and need not be limited to the data pertaining to a single orrespective agent. The weighting may be adaptive, that is, the weightingneed not be invariant, and may change over time based on a number offactors. The weightings may also be time dependent, for examplefollowing a diurnal variation.

Each agent is assigned a metric with respect to each skill. This processmay be manual or automated, however, a number of advantages accrue froman automated analysis of agent skill level. Typically, an initial skilllevel will be assigned manually or as a result of an off-lineassessment. As the agent is presented with tasks, the proficiency of theagent is analyzed, and the results used to define skill-specificmetrics. As stated above, since the skill definitions are normative, theskills of one agent are compared or comparable to skills of others. Forexample, the skill sets are assigned using a multivariate analysistechnique, based on analysis of a plurality of transactions, predictingthe best set of skills consistent with the results achieved. In thisanalysis, each skill metric may be associated with a reliabilityindicia; that is, in some instances, where the outcome of clearlydeterminable, and a skill as defined is highly correlated with theoutcome, the reliability of the determined skill value for astatistically significant sample size is high. On the other hand, wherea particular skill is relatively unrelated to the tasks included withinthe data analysis set, that is, the outcome factor is relativelyuncorrelated with the value of the skill, the reliability of adetermination of an agent skill will be low.

A related issue relates to inferring an agent skill level for a skillparameter where little or no data is available. For this task,collaborative filtering may be appropriate. A collaborative filter seeksto infer characteristics of a person based on the characteristics ofothers having similar associated parameters for other factors. Seereferences cited and incorporated by reference above. In this case,there is only a small analytic difference between a parameter for whichdata is available from a respective agent, but yields an unreliablemeasurement, and a parameter for which data is unavailable, but can beinferred with some reliability. Therefore, the skill determining processmay employ both techniques in a composite; as more data becomesavailable relating to an actual skill level of an agent with respect toa skill parameter, reliance on inferred skill levels is reduced. It istherefore an aspect of one embodiment of the invention that acollaborative filter is used to infer agent skill levels where specificdata is unavailable. It is also an aspect of an embodiment of theinvention that in addition to a skill level metric, a reliabilityestimate for the measurement of the skill level metric is also madeavailable.

It is noted that in defining a desired agent profile for a task, theskill metrics themselves are subject to unreliability. That is, thetarget skill levels themselves are but an estimate or prediction of theactual skills required. Therefore, it is also possible to estimate thereliability of the target skill level deemed desired. Where the targetskill level is low or its estimate unreliable, two separate and distinctparameters, the selected agent may also have a low or unreliablydetermined skill level for that attribute. On the other hand, where askill is reliably determined to be high, the agent skill profile shouldalso be high and reliably determined.

In other instances, the metric of skill does not represent aquantitative metric, but rather a qualitative continuum. For example,the optimal speech cadence for each customer may differ. The metric, inthis case, represents a speech cadence parameter for an agent. The ideais not to maximize the parameter, but rather to optimize it. Therefore,reliability in this instance does not equate to a reduction in estimatedmagnitude. It is also noted that a further ancillary parameter may beapplied for each skill, that is, tolerance to mismatch. For example,while call received by a call center, for technical support, may seek anagent who is more knowledgeable than the caller is with respect to theproblem, but not one who is so far advanced that a communication gapwould be apparent. Thus, an optimum skill parameter as well as a rangeis defined. In like manner, other descriptors of a statistical functionor distribution may be employed, for example, kurtosis and skew.

It is noted that there are a number of ways of scoring outcome of acall, and indeed, a number of parallel scoring systems may be employed,although they should be consistently applied; that is, if an agent isselected for handling a call based on one paradigm, care should beemployed in scoring the agent or the call outcome using a differentparadigm. Such cross analyses, however, may be useful in determining anoptimum outcome analysis technique.

When a new matter is to be assigned to an agent, the pool of agents areanalyzed to determine, based on the predefined skills, which is the bestagent. Selecting the best agent for a task is dependent on a method ofscoring outcome, as discussed above. In some instances, there is arelatively simple process. For example, agents entrusted to sell asingle product can be scored based on number of units sold per unittime, or the time it takes to close a sale. However, where differentproducts are for sale, optimization may look at different parameters,such as call duration, revenues per call or unit time, profit per callor unit time, or the like. As the variety of options for a user grows,so does the theoretical issues involved in scoring an agent.

It is also possible for agents to engage in an auction; that is, agentsbid for a caller. In this case, an agent must be sufficiently competentto handle the call based on the information available, and agents withskills far in excess of those required may be excluded from the bidderpool. For example, agents may be compensated on a commission basis. Thebidding may involve an agent bidding a commission rate (up to themaximum allowed). In this way, the employer gets the benefit ofcompetition between agents. The bid, in this instance, may be a manualprocess entered into by the agent as a prior call is being concluded.

The bid may also be automatically generated at an agent station, basedon both objective and subjective factors. See, U.S. patent applicationSer. No. 10/71,182 (Steven M. Hoffberg, inventor), expresslyincorporated herein by reference, and Steven M. Hoffberg, “Game Theoryin the Control of Ad Hoc Networks”, Wireless Systems Design 2004 (SanDiego, March 8). That is, a bid may be automatically defined andsubmitted on behalf of an agent. The bid may be defined based on aneconomic or other criteria.

The optimization of agent selection may also be influenced by otherfactors, such as training opportunities. Therefore, in determining acost benefit of selection of a particular agent, a training cost/benefitmay also be included.

Thus, according to a simplistic analysis, the agent with the highestscore is selected. This is, indeed an “optimum” condition, assuming thatthere is uniform incremental cost in selecting each agent, and that thesystem remains static as a result of the selection. On the other hand,if agent costs differ, or the system status is materially altered on thebasis of the selection, or there are extrinsic factors, such astraining, then the optimum may also differ.

A number of factors may also influence optimality of selection. Whilemost are merely business-based considerations, some may be politicallyincorrect (bad public policy), or even illegal. For example, anoptimization may take into account discrimination on an illegal basis,resulting in harm to either callers or agents within a protected class.That is, a traditionally discriminated-against minority may be subjectedto automated and institutionalized discrimination as a result of analgorithm which favors a discriminatory outcome. In fact, thediscriminatory outcome may be both efficient and optimal, under aneconomic or game theory analysis. However, this may be undesired. Oneway to counteract this is to estimate the discriminatory impact of thealgorithm as a whole and apply a global antidiscriminatory factor. Whilethis has the effect of correcting the situation on an overall level, itresults in significant inefficiencies, and may result in aredistribution in an “unfair” manner. Further, the antidiscriminatoryfactor is itself a form of discrimination.

Another method for approaching this problem is to analyze the profile orskill vectors a the presumably discriminated-against agent or customerclasses, and compare this to the corresponding vectors ofnon-discriminated-against class of agents or customers. Assuming thatdiscrimination occurs on a class basis, then, a corrective factor may beused to normalize components of the vector to eliminate thediscriminatory effect.

A further method of remediating the perceived discrimination is throughtraining. In this case, the presumably objective outcome determinationsare not adjusted, nor is the “economic” model for optimal agentselection disturbed. Instead, a mismatch of the skill profile of anagent with the caller is used as an opportunity to modify behavior(presumably of the agent), such that the deficiency is corrected.

For example, a call center agent may have a characteristically ethnicaccent. In one case, the agent accent may be matched with acorresponding caller accent, assuming that data shows this to beoptimum. However, assuming that vocal ethnicity relates to socioeconomicstatus, the result may be that the value of the transaction (or otherscore value) is associated with this status. The goal would therefore befor the agent to retrain his or her accent, and indeed use a differentaccent based on an inferred optimal for the caller, or to overcome thisimpediment by scoring well in transactions involving those other than a“corresponding” accent. Each of these is subject to modification throughagent training.

Therefore, it is apparent that the optimization may be influenced byeconomic and non-economic factors, and the optimization may includeobjective and subjective factors.

The system may also intelligently analyze and control other aspects oftelecommunications besides call routing. For example, it is particularlyadvantageous to characterize the caller, especially while the call is inthe queue. However, increasing the amount of information which must becommunicated between the switch control and a high-level system isundesirable, thus limiting the ability to extract low-level informationfrom the caller. Such information may include preferred language, avoice stress analysis, word cadence, accent, sex, the nature of the call(IVR and/or speech recognition), personality type, etc. In fact, much ofthis information may be obtained through interaction and/or analysis ofthe caller during the queue period. Further, in some instances, it maybe possible to resolve the caller's issues without ever connecting to anagent, or at least to determine whether a personal or automatedresolution is preferred. According to an aspect of the invention, theswitch itself may control and analyze the interaction with the caller.Advantageously, the switch may further perform a sensitivity analysis todetermine which factors relating to the call are most useful withrespect to selecting an appropriate agent, and more particularly bylimiting this analysis to the agents within the pool which are likely tobe available. Further information characterizing the user may also begathered to construct a more detailed user profile.

It is noted that, in some cases, a caller prefers to remain passive inthe queue, while in other instances, the caller would prefer to activelyassist in optimizing the experience. This does not necessarily correlatewith a universal caller profile, nor the optimal selection of agent.This can be quickly ascertained, for example through IVR.

It is noted that an efficient analysis performed by the switch maydiffer from an efficient analysis performed or controlled by a highlevel system. For example, a high level system may employ speechrecognition technology for each caller in a queue. The switch, on theother hand, would likely not be able to implement speech recognition foreach caller in a large queue internally. Further, since the profile ofthe caller and the correspondence thereof to the agent skill profile, aswell as the correlation to the outcome, is dependent on the selection ofcharacteristics for analysis and outcome metric, the parameters of each,according to the present invention, will also likely differ.

Returning now to the problem of routing a call using an intelligentswitch, the condition of optimality in the case of equal incrementalcost, a stationary system condition as a result of the selection, andscalar skill parameters having a magnitude correlated to value, isdenoted by the formula:A _(n)=Max Σ(rs _(i) a _(n) s _(i))

Which denotes that Agent “n” is selected by maximizing the sum, for eachof the required skills s_(i), of the product of weighting for that skillrs_(i), and the score for agent n a_(n)s_(i).

As stated above, this optimization makes two very important, and notalways applicable assumptions. First, more highly skilled agents of tenearn higher salaries. While, once scheduled, presumably the direct costis fixed, over the long term, the pool of agents must be adjusted to therequirements, and therefore the selection of an “expensive” agent leadsto increased costs. On the other hand, by preferentially selecting theskilled agent over the unskilled agent, the job experience for theskilled agent may be diminished, leading to agent retention problems.Likewise, the unskilled agent is not necessarily presented withopportunities for live training. Thus, it is seen that the agent costmay therefore be a significant variable.

The formula is therefore modified with a cost function as follows:A _(n)=Max [Ac _(n1)Σ(rs _(i) a _(n) s _(i))+Ac _(n2)]

Wherein Ac_(n1) and Ac_(n2) are agent cost factors for agent n. Todetermine the anticipated cost, one might, for example, divide the dailysalary by the average number of calls per day handled by the agent.This, however, fails to account for the fact that the average length ofa call may vary based on the type of call, which is information presumedavailable, since the skill set requirements are also based on aclassification of the type of call. Further, an agent highly skilled insome areas may be relatively unskilled in others, making an average callduration or average productivity quite misleading. Another cost to beconsidered is training cost. Since this is generally considereddesirable, the actual value may be negative, i.e., an unskilled traineemay be selected over a highly skilled agent, for a given call, eventhough the simple incremental agent costs might tend toward a differentresult. Likewise, selection of an agent for a certain call may beconsidered a reward or a punishment for good or bad performance, andthis may also be allocated a cost function. The key here is that all ofthese disparate factors are normalized into a common metric, “cost”,which is then subject to numeric analysis. Finally, the optimization mayitself evolve the skill sets and cost function, for example throughtraining and reward/punishment.

The cost of the “connection” between a caller and an agent may also beconsidered, for example in a multi-location call center, or where agentsare compensated on a per-call basis.

Another factor to be considered in many cases is anticipated outcome. Insome instances, the outcome is irrelevant, and therefore productivityalone is the criterion. On the other hand, in many cases, the agentsserve a business purpose, and call outcomes may be graded in terms ofachieving business goals. In many instances, the business goal is simplean economic parameter, such as sales volume, profit, or the like, andmay be directly computed within a cost function normalized in economicunits. On the other hand, some business goals, such as customersatisfaction, must be converted and normalized into economic terms priorto use in an optimization. In any case, the expected outcome resultingfrom a particular agent may be added as a factor in the cost function.

Another factor to consider in making a selection of an agent in amulti-skill call center is the availability of agents for other calls,predicted or actual. Thus, while a selection of an agent for one mattermay be optimal in a narrow context, the selected agent might be morevaluable for another matter. Even if the other matter is predicted orstatistical, in some instances it is preferred to assign morespecialized agents to matters that they can handle, rather thanassigning multitalented agents.

This is represented as follows:A _(n)=Max<({[Ac _(n1)Σ(rs _(i) a _(n) s _(i))+Ac _(n2) ]+Bc _(n) }+Cc_(n))+Dc _(n)>.

Wherein B_(c) represents a term for the anticipated change in value ofagent n as a result of the selection, C_(c) represents a term whichindicates the anticipated value of the transaction resulting from theselection of agent n, and D_(c) represents the opportunity cost forallocating agent n to the particular call.

In the case of competing requests for allocation, a slightly differentformulation of the problem may be stated. In that case, one mightcompare all of the cost functions for the matters in the queue withrespect to each permissible pairing of agent and matter. Instead ofselecting an optimal agent for a given matter, the system selects anoptimal pairing of respective multiple agents with multiple matters. Inthe case of a call center, of ten the caller hold time is considered abasic criterion for selection. In order to weight this factor, forexample, the cost function includes an allocation for caller hold time,and possibly a non-linear function is applied. Thus, a caller may betaken out of order for paring with an optimal agent.

In some cases, the variance of a parameter is also considered, inaddition to its mean value. More generally, each parameter may itself bea vector, representing different aspects.

It is noted that the various factors used in the system may be adaptive,that is, the predicted values and actual values are compared, and theformula or variables adjusted in a manner which is expected to improvethe accuracy of the prediction. Since outcome is generally measured inthe same metric as the cost function, the actual cost is stored alongwith the conditions of the predictive algorithm, and the parametersupdated according to a particular paradigm, for example an artificialneural network or the like. Typically, there will be insufficient datapoints with respect to a system considered static to perform analgebraic optimization.

The present invention provides cost function optimization capabilitiesat a relatively low level within the call routing system. Thus, forexample, prior systems provide relatively high level software, operatingon massive customer relations management (CRM) database systems, to seekoptimization.

On the other hand, according to the present invention, the parametersare supplied in advance, generally in a batch format, to the low levelrouting and computer integrated telephony (CTI) software, which computesthe cost functions. Call outcome data is generally available during andafter a call to the high level software, which can then set or adjustvalues as necessary for the future.

It is noted that, generally, the architecture according to the presentinvention would not generally provide agent scheduling information,since this represents a task separate from the call routing functions.Therefore, known systems which integrate both tasks are typicallydistinguished from the present invention. However, it would be possibleas a separate process for this to be performed on the telephony serveraccording to the present invention. More generally, the updating ofagent skill tables or a database, and agent scheduling and call centermanagement, are performed on high level systems which are discrete fromthe telephony server. These systems typically access large databases,generate reports, and integrate many different functions independent ofthe communications functions.

The advantage of a preferred architecture according to the presentinvention is that when a call is received, it can be routed in realtime, rather than after a possibly significant delay. Further, this dataprocessing partition reduces data communications bandwidth requirementsand reduces transactional load on the CRM system. In addition, thisarchitectural partition reduces the need for the CRM system to beinvolved in low level call management, and reduces the need for the CTIsoftware to continually interact with the high level CRM software. This,in turn, potentially allows use of simple architecture CTI platformsusing standard operating systems.

According to a preferred embodiment, the matter skill requirements,agent skill data, and other parameters, are provided to the CTIsoftware, for example as an ASCII table. The CTI software may, forexample, invoke a subprocess for each call received or in the queue, todetermine the then-optimum agent selection, for a local optimization,i.e., a selection of the optimal agent without regard for the effect ofthis selection on other concurrent optimizations. In order to globallyoptimize, the processing is preferably unitary. As conditions change,for example, further calls are added to the queue, or calls arecompleted, the optimizations may be recomputed.

For example, in a call center with 500 agents, each classified withrespect to 32 skills, with an average of 2000 calls in the queue, withabout 50 agents available or anticipated to be available at any giventime, the computational complexity for each optimization is on the orderof 160×10⁶ (2000×50×50×32) multiplies, generally of 8 bit length. A 2GHz Pentium 4 processor, for example, is capable of theoreticalperformance of about 2400 MFLOPS. Using a simplified calculation, thismeans that less than about 10% of the raw capacity of this processorwould be required, and more powerful processors are being introducedregularly. For example, a 3.06 GHz Pentium 4 processor with“hyperthreading” has recently been introduced. In fact, in real-worldsituations, the processor would likely not be able to achieve itsbenchmark performance, but it is seen that a single modern processor canhandle, in near real time, the required processing. Coprocessing systemsare available which increased the processing capability, especially withrespect to independent tasks, while allowing all processes to becoordinated under a single operating system. For example, MicrosoftWindows and Linux both support multiprocessing environments, in caseincreased processing capacity is required.

On the other hand, if a high level CRM system is interrupted to processeach call event to globally reoptimize agent selection, and communicatethis with the CTI software, a significant communication and transactionburden would be encountered.

Thus, the present invention proposes that the skill-based call routingalgorithm be executed in conjunction with the low level CTI process, asan integral part of the call routing function. Likewise, othercall-process related algorithms may be implemented, in addition to orinstead of a call routing calculation.

Advantageously, for example in many non-adaptive systems, no high levelCRM system is required, and the entire skill-based routing functionalitymay be implemented in the CTI system, saving significant hardwareexpense and software complexity. Thus, where the cost function isrelatively simple to calculate, the skills required for the call and theskills of each respective agent well known and relatively constant, asimple database may be provided for the CTI platform to route callsintelligently.

Another aspect of the invention provides optimization of communicationsmanagement based on adaptive parameters, e.g., not only on the existingskills of the respective agents, but rather also based on an anticipatedor predicted change in the agent's skills as a result of handling thecall. Likewise, when considering an overall cost function for optimizingcall directing, any variety of factors may be considered within itscontext. Therefore, it an another object to provide a consolidated costfunction for communications management, wherein pertinent factors orparameters are or may be expressed in common terms, allowing unifiedconsideration. According to a preferred embodiment of the invention,this is handled at a low level within the communications managementsystem, although various aspects may be handled in real time orotherwise at various levels of the communications management system.

In the case of real time communications, such as traditional voicetelephony, the switching must by definition occur in real time, so mustthe resolution of the parties to the communication. Therefore, anotheraspect of the invention involves communications and coordination in realtime of the various system components, including the low level system.Preferably, the data upon which an optimization is based is availablelocally to the low level system before a real time communication isreceived, so that external communications to resolve the target areminimized. In some cases, communications with other system componentswill still be required, but preferably these do not require essentiallynon-deterministic systems to respond prior to resolution.

Another aspect of the invention seeks to optimize long term call centeroperations, rather than immediate efficiency per se. Thus, at varioustimes, the system performs functions which are different or evenopposite the result expected to achieve highest short term efficiency.Preferably, however, during peak demand periods, the system assures highshort term efficiency by switching or adapting mode of operation.

Therefore, according to the present invention, a number of additionalfactors are applicable, or the same factors analyzed in different ways,beyond those employed in existing optimizations. Since most call centersare operational for extended periods of time, by analyzing andoptimizing significant cost factors beyond those contemplated by theprior art, a more global optimization may be achieved.

In a service environment, the goal is typically to satisfy the customerat lowest cost to the company. Often, this comes through making areasonable offer of compromise quickly, which requires understanding theissues raised by the customer. Delay leads to three costs: the directand indirect operations cost; the possibility of increased demands bythe customer (e.g., impaired business marginal utility of thecommunication); and the customer satisfaction cost.

In technical support operations, the agent must understand the technicalissues of the product or service. The agent must also understand thepsychology of the user, who may be frustrated, angry, apologetic, oreven lonely. The agent must of ten remotely diagnose the problem, orunderstand the information provided by the caller, and communicate asolution or resolution.

In some instances, these seemingly abstract concepts are represented inrelatively basic terms at the communications server level. For example,the cadence of a speaker may be available by a simple analysis of avoice channel for silence and word rate. Stress may also represented ina spectral analysis of voice or in other known manner. Alcoholism orother impairment may be detected by word slurring, which may also bedetected by certain signature patterns in the voice pattern.

It is noted that, in some instances, the skill related parameters arenot independent. That is, there is a high cross correlation or otherrelationship between the parameters. In other instances, there arenon-linearities in the process. A simple summing of magnitude timesweight for these parameters may introduce errors. Therefore, a morecomplex algorithm may be employed, without departing from the spirit orscope of the present invention.

Likewise, for each caller profile class, a different optimization may beemployed. There are some traits, such as alcoholism, which may alter theoptimal selection of agent, all other thing being equal.

Therefore, communications routing on seemingly sophisticated or abstractconcepts may be efficiently handled at a low level without interruptingthe basic call processing functions or requiring non-standard hardware.In this sense, “non-standard” refers to a general purpose type computingplatform performing the communications routing functions. In fact,efficiency is generally enhanced according to the present invention byavoiding the need for remote communications of the call parameters andthe resulting communications and processing latencies. Of course, incertain tightly coupled environments, the target resolution may beperformed on a physically separate processor or system from the lowlevel call processing, without deviating from the essential aspects ofembodiments of the invention.

In many cases, the caller characteristics and issues will of ten have asignificant effect on the duration of the call. While, in general, moreskilled agents will have a higher productivity, in some cases, thecaller restricts throughput. Therefore, even though the agent is capableof completing the call quickly, the caller may cause inordinate delays.According to the present invention, through a number of methods, thecaller characteristics are determined or predicted, and an appropriateagent selected based on the anticipated dynamic of the call. Thus, forexample, if the anticipated call duration for a successful outcome,based on the caller characteristics is a minimum of 5 minutes (dependingon the agent), then an agent who is likely to complete the call in about5 minutes may be selected as the optimum; agents who would be able tocomplete the call within 4 minutes, while technically more productive,may have little impact on the actual call duration, and thus would beinefficiently employed. Likewise, an agent anticipated to complete thecall in 6 minutes might be deemed inefficient, depending on theavailability of other agents and additional criteria. The call may beselected as a training exercise. In this case, an agent is selected fortraining whom would be expected to operate with a certain degree ofinefficiency to complete the call. In some cases, unsupervised trainingis instituted. In other cases, a training agent (or automated system) isallowed to shadow the call, providing assistance, instruction and/ormonitoring of the trainee agent during the call. In this case, it wouldbe anticipated that the call duration would be greater than 5 minutes,due to the training nature of the call. Further, the required trainerassistance further reduces immediate efficiency. However, as the agentsin the pool become more skilled, long term efficiency increases.

Preferably, these characteristics are extracted through an analysis, bythe communications control system, of the available data, although whereappropriate, reference to higher level systems may be performed. Thus,in an interactive voice (or key) response system, there may besufficient time and resources available to query a high level system fordata or request analysis relating to a call. However, in many instances,significant analysis may be performed using the computing resources andinformation available to the low level communication processing system.Even where the information is not available, a DNIS or other type oflookup may provide this information based on a relatively simple query.

More highly skilled agents are both worth more and generally commandhigher compensation. A program which trains agents internally is eitherrequired, due to lack of specific external training programs, or is costeffective, since new hires can be compensated at a lower rate thantrained and experienced hires. Thus, for long-term operations, there isan incentive to train agents internally, rather than seeking to hiretrained agents. Therefore, according to another aspect of the invention,such training, past present and/or future, is monetized and employed inoptimization of a cost function.

Agents may receive additional compensation for training activities,either for their training activities, performance based compensationbased on the improvement of their trainees, or both. Thus, there is anincentive for agents to become skilled and to assist in the training. Asa result, the average skill level and uniformity in a call center willincrease. However, since the optimal skill palette within a call centertypically is a moving target, the training process will never cease.

Often, live interaction is an important component of training.Therefore, a significant component of the training encompassesinteraction with callers in real-world situations. Training of teninvolves presenting agents with new challenges and experiences in orderto assure breadth of exposure.

According to prior skill-based routing schemes, an agent skill level isconsidered a static upper limit on capabilities, and the ACD avoidsdistributing calls to agents below a threshold. Agents may be calledupon to serve requests within their acknowledged skill set. Likewise,this allows a simple and discrete boundary condition to be respected inthe optimization according to the present invention.

On the other hand, according to some embodiments of the presentinvention, each call is considered a potential training exercise, inorder to expand the capabilities of the agent, and therefore theboundary is not concretely applied. Therefore, to the extent that thenature of the call can be determined in advance, the incentive accordingto this scheme is to route the call to an agent who is barely capable ofhandling the call, and to avoid routing only to the best availableagents. This strategy has other implications. Because agents arechallenged continually, there is reduced incentive for an agent to limithis skills to avoid the “tougher” assignments. Further, aself-monitoring scheme may be implemented to determine the status of anagent's skill with each call. For example, agent performance istypically determined on a call-throughput basis, since call centers aremanaged on a man-hour requirement basis and agents compensated on aper-hour basis. Therefore, based on a presumed agent skill set and anestimation of the skills required for a given call, a call duration maybe predicted. The actual duration is then compared with the predictedduration, providing a performance metric for the agent.

This scheme also allows determination of the pertinent factors for callduration, both based on the information about the call or caller and theskill set of the agent. Thus, a variety of low-level data may becollected about a volume of calls, which may be statistically orotherwise analyzed to determine significant relations. For example, anartificial neural network or fuzzy-neural network may be implementedbased on the data, which may then be automatically analyzed based on theindependent criteria, e.g., call duration, cost function, or the like.

It is noted that, during peak demand periods, reduced productivity dueto training exercises is preferably minimized. Thus, as demandincreases, high skill set agents are preferably reassigned from trainingto most-efficient operational status, while lower skill set agents areassigned to calls well within their capabilities. Thus, during such peakdemand periods, the staffing requirement will generally be no worse thantraditional call centers. On the other hand, since training isintegrated with operations, over a period of time, the average skill ofall agents will increase. Thus, more skilled agents will be available atpeak periods, reducing overall staffing requirements over a long termdue to an expected decrease in average call duration and increase inagent productivity.

According to this embodiment of the invention, it is less critical toperform the call routing resolution in the low level system, since thereal time criteria is not particularly limited by processing andcommunication latencies. On the other hand, corresponding skill routingfunctions may be performed by the communications processing system forboth outbound and inbound communications, thus permitting asimplification of the external supporting systems.

An embodiment of the present invention provides an Internet Protocolbased communications architecture, permitting geographically dispersedphysical communications locations to act as a single coordinated entity.In order to centrally manage a queue, the various pieces of informationmust be available for processing. As noted above, an interactiveoptimization may require a real time comparison of all available agents.In this architecture, in cases of an ad hoc organization or peak demandperiods, freelance agents may be called upon dynamically as required.Thus, if a peak demand period is much shorter than an agent shift,off-site freelance agents may be dynamically called upon, for examplethrough the Internet, ISDN, POTS, DSL, Cable modem, or a VPN, to handlecalls. In this case, the optimal training of such off-site or freelanceagents will generally differ from those who are in-house agents. Forexample, if freelance agents are called upon only during peak demandperiods, these agents will be trained specifically for the skills inshort supply during such periods, or for generic skills which arecommonly required.

In order to gage the skill set required of an agent for a call, a numberof methods may be employed. Using a menu or hierarchal menu, a series ofquestions may be asked of callers in the queue to determine the identityof the caller and the nature of the call. Likewise, ANI/DNISinformation, IP address or the like, or other communications channelidentifier may be employed to identify the calling telephonecommunications channel. This information may directly indicate thecharacteristics or desired characteristics of the communication, or beused to call an external database record associated with the identity ofthe caller or communications channel. While it is possible to associatesuch a database closely with the low level communications processingsystem, this is not generally done, since it may impair thedeterministic characteristics of the communications processing system.Rather, if such information is required by the low level communicationssystem for resolution, and cannot be stored locally in a data table, itis preferred that it be available through a closely coupled, butindependent system. As discussed above, it is preferred that a callentering the queue require no more than a single database query andreceipt of response prior to action, although other non-time criticalaccess may occur both before and after action. The prior art, on theother hand, generally provides such information through independent andgenerally high level systems. High level systems are generallycharacterized by general purpose interfaces, broad range offunctionality, and often a communications protocol having a rich andcomplex grammar. On the other hand, tightly coupled systems can of tenforgo extensibility and interoperability in favor of efficiency.

In many instances, call centers are implemented to provide support forcomputer systems. It is known to provide a message automaticallygenerated by a computer to identify and report the status of thecomputer at a given time, and possibly the nature of a computer problem.One aspect of the present invention allows this message to be associatedwith a direct semantic communication session with the user, for exampleto predefine the nature of the call and possibly the skill set requiredto address the issues presented. Thus, for example, a caller may beprompted to specify information of particular relevance in the routingprocess, while not being prompted for information irrelevant to theselection. For example, if only one agent is available, the entireprompting process may be bypassed. If two agents are available, theirprofiles may be analyzed, and only the most critical distinctionsprobed. This entire process may be handled in the low levelcommunications processing system, without substantial loss of efficiencyor throughput in that system, and with substantial gains in overallarchitectural efficiency.

Often, a highly skilled agent will serve as mentor for the trainee, and“shadow” the call. Thus, the routing of a call may depend onavailability of both trainee and skilled instructor. Thisdual-availability checking and pairing may be performed in the low levelsystem.

Another aspect of call center efficiency impacted by this scheme isagent motivation. Because an agent with lower skill levels will be givenassignments considered challenging, while more skilled agents giventraining assignments which may be considered desirable, there is anincentive for agents to progress, and likewise no incentive to avoidprogressing. Thus, an agent will have no incentive to intentionally orsubliminally perform poorly to avoid future difficult skill-basedassignments. These factors may be accommodated in a cost functioncalculation, for example with an update of the agent vector after eachcall based on call characteristic vector, call outcome and duration,chronological parameters, and the like.

In operation, the system works as follows. Prior to call setup, thenature of the call is predicted or its requirements estimated, as wellas the prospective issues to be encountered. This may be performed instandard manner, for example in an inbound call based on the numberdialed, based on the ANI/DNIS of the caller (with possible database pasthistory lookup), selections made through automated menus, voicemessages, or other triage techniques. In the case of outbound calls, adatabase of past history, demographic information (both particular tothe callee and for the region of the call), and nature of the call mayall be used to determine the projected agent skill set required for thecall. Alternately, only parameters available locally to thecommunications control system are employed, which, for example, mayexclude a past history database lookup. Collaborative filtering may beused to assist in inferring a profile of a remote user.

It is noted that, after initial call setup, the actual skill setrequired may become apparent, and the call may be rerouted to anotheragent. For example, this may be performed at a high level, thuspermitting correction of errors or inappropriate selections made by thelow level system.

Once the predicted skill sets are determined, these are then comparedagainst a database of available agents and their respective skill sets.A weighting is applied based on perceived importance of selectioncriteria, and the requirements correlated with the available agent skillsets.

When the call center is operating below peak capacity, marginallyacceptable agents may be selected to receive the call, possibly with ahighly acceptable agent available if necessary for transfer or handoffor to monitor the call. When the call center is operating near peakcapacity, the agents are assigned to minimize the anticipated man-hourburden (throughput) and/or wait time. Thus, peak throughput operationgenerally requires that agents operate within their proven skill sets,and that training be minimized.

Each call is associated with a skill expression that identifies theskills that are relevant to efficient handling of the call. Aspreviously noted, the preferred embodiment is one in which more than onerelevant skill is identified, so that all of the factors that determinea “best” agent for handling a call can be considered. This is expressed,for example, as a call characteristic vector. The relevant skillsrequired may be determined using different techniques.

The skill expression of a call includes the required skills and skilllevels for efficiently handling the call. In one embodiment, the skillsmay be divided into two categories: mandatory and optional skills.Mandatory skills are those skills that an agent must possess in order tohandle the call, even if the call remains in queue for an extendedperiod of time. For example, language proficiency is of ten a mandatoryskill for handling a call. Optional skills are those that are consideredin the selection of the appropriate agent, but not critical. Inoperation, these mandatory skills are expressed as a high relevancerating with respect to a call characteristic having a non-linear (e.g.,binary or sigmoid) characteristic. Therefore, in the absence ofexceptional circumstances, other factors for qualified agents willdetermine resolution. Alternately, the mandatory skills may be specifiedas a pre-filter, with optional skills and cost function expressedthrough linear-type equations.

It is noted that the peak/non-peak considerations may be applied on acall-by-call basis. Thus, certain callers may be privileged to have ashorter anticipated wait and greater efficiency service than others.Thus, these callers may be treated preferentially, without altering theessential aspects of the invention.

The present invention may also generate a set of reports directed tomanagement of the call center. Typically, the communications servergenerates a call log, or a statistically processed log, for analysis bya higher level system, and does not generate complete, formatted reportsitself. The quality of service reports are generated to indicate theeffectiveness of the call-management method and system. An agent summaryreport is organized according to the activities of particularindividuals, i.e. agents. A skill summary report organizes the data byskill expressions, rather than by agents. This report may list thenumber of calls requiring selected skill expressions and the averagetime spent on those calls. Other known report types are also possible.An important report type is the improvement in call center efficiencyover time, i.e., decreased wait time, increased throughput, increasedcustomer satisfaction, etc. Thus, each agent should demonstrate improvedskills over time. Peak throughput should meet or exceed reasonableexpectations based on a statically skill-routed call center. Othermetrics may also be evaluated. Such reports are typically not generatedfrom low level communications systems, and are considered an inventivefeature.

It is therefore an object of the invention to provide a communicationscontrol system comprising an input for receiving a call classificationvector, a table of agent characteristic vectors, and a processor, for(a) determining, with respect to the received call classification, anoptimum agent selection based on at least a correspondence of said callclassification vector and said table of agent characteristic vectors,and (b) controlling a call routing of the information representing saidreceived call in dependence thereon. It is a further object of theinvention to provide a system wherein the process maintains a table ofskill weights with respect to the call classification, and applies saidweights to determine an optimum agent selection.

Another object of the invention is to provide a communications controlsystem for handling real time communications, wherein an integral systemresolves a communications target based on an optimizing algorithm andestablishes a communications channel with the resolved communicationstarget.

A further object of the invention provides a communications methodcomprising receiving a call, classifying the call to determinecharacteristics thereof, receiving a table representing characteristicsof potential targets, determining an optimum target based on thecharacteristics of both the call and the potential targets, and routingthe received call to the optimum target, the determining step and therouting step being performed by a common platform.

A still further object of the invention provides a communicationscontrol software system, comprising a multithreaded operating system,providing support for applications and for passing messages betweenconcurrently executing applications, a communications control serverapplication executing under said multithreaded operating system, forcontrolling real time communications, and at least one dynamicallylinkable application, executing under said multithreaded operatingsystem, communicating with said communications control serverapplication to receive call characteristic data and transmit a resolvedcommunications target.

Another object of the invention provides a method of determining anoptimum communications target in real time, comprising receiving acommunication having an indeterminate target, selecting an optimumtarget, and establishing a channel for the communication with theoptimum target, wherein said selecting and establishing steps areperformed on a consolidated platform.

It is a further object of the invention to provide a communicationsprocessing system for directly establishing and controllingcommunications channels, receiving information regarding characteristicsof a preferred target of a communication, comparing the characteristicswith a plurality of available targets using an optimizing algorithm, andestablishing the communication with the target in dependence thereon.

It is another object of the invention to provide a method of selecting acall handling agent to handle a call, comprising the steps ofidentifying at least one characteristic of a call to be handled;determining a call center load, and routing the call to an agent independence on the characteristic, call center load, and agentcharacteristics.

A further object of the invention provides a method optimizing anassociation of a communication with an agent in a communications center,comprising the steps of determining a characteristic of a communication;accessing a skill profile of a set of agents; cost-optimizing thematching of the communication with an agent based on the respectiveskill profile, and routing the call to a selected agent based on saidcost-optimization with a common system with said optimizing.

An object of the invention also includes providing a method for matchinga communication with a communication handler, comprising the steps ofpredicting a set of issues to be handled during the communication;accessing a profile record for each of a plurality of communicationshandlers; analyzing the profile records with respect to the anticipatedissues of the communication to determine a minimal capability; selectingan optimum communication handler; and controlling the communication, allcontrolled within a common process.

The foregoing has outlined some of the more pertinent objects of thepresent invention. These objects should be construed to be merelyillustrative of some of the more prominent features and applications ofthe invention. Many other beneficial results can be attained by applyingthe disclosed invention in a different manner or modifying the inventionas will be described. Accordingly, other objects and a fullerunderstanding of the invention may be had by referring to the followingDetailed Description of the preferred embodiment.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and theadvantages thereof, reference should be made to the following DetailedDescription taken in connection with the accompanying drawings in which:

FIGS. 1 and 2 are flow charts showing a skill routing method accordingto the present invention.

FIG. 3 shows a block diagram in accordance with the present invention.

FIG. 4 shows a flowchart in accordance with the present invention.

FIGS. 5 and 6 show block diagrams in accordance with the presentinvention.

FIGS. 7 and 8 show flowcharts in accordance with the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The Detailed description of the invention is intended to describerelatively complete embodiments of the invention, through disclosure ofdetails and reference to the drawings. The following detaileddescription sets forth numerous specific details to provide a thoroughunderstanding of the invention. However, those of ordinary skill in theart will appreciate that the invention may be practiced without thesespecific details. In other instances, well-known methods, procedures,protocols, components, and circuits have not been completely describedin detail so as not to obscure the invention. However, many suchelements are described in the cited references which are incorporatedherein by reference, or as are known in the art.

For each agent, a profile is created based on manual inputs, such aslanguage proficiency, formal education and training, position, and thelike, as well as automatically, based on actual performance metrics andanalysis, and used to create a skills inventory table. This process isgenerally performed in a high level system, such as a customer relationsmanagement system or human resources management system. A profile thusrepresents a synopsis of the skills and characteristics that an agentpossesses, although it may not exist in a human readable or humancomprehensible form.

Preferably, the profile includes a number of vectors representingdifferent attributes, which are preferably independent, but need not be.The profile relates to both the level of ability, i.e. expertise, ineach skill vector, as well as the performance of the agent, which may bea distinct criterion, with respect to that skill. In other words, anagent may be quite knowledgeable with respect to a product line, butnevertheless relatively slow to service callers. The profile, or anadjunct database file, may also include a level of preference that callmanagement has for the agent to handle transactions that requireparticular skills versus transactions that require other skills, orother extrinsic considerations.

This table or set of tables is communicated to the communicationsserver. Typically, the communications server does not create or modifythe agent skills table, with the possible exception of updatingparameters based on immediate performance. For example, parameters suchas immediate past average call duration, spoken cadence, and otherstatistical parameters of a call-in-progress or immediately pastconcluded will be available to the communications server. Theseparameters, which may vary over the course of a single shift, may beused to adaptively tune the profile of the agent in real time.Typically, however, long term agent performance is managed at higherlevels.

FIG. 1 shows a flow chard of an incoming call routing algorithmaccording to a preferred embodiment of the present invention. A call isplaced by a caller to a call center 301. The call is directed, throughthe public switched telephone network, although, calls or communicationsmay also be received through other channels, such as the Internet,private branch exchange, intranet VOIP, etc. The source address of thecall, for example the calling telephone number, IP address, or otheridentifier, is received to identify the caller 302. While the call is inthe waiting queue, this identifier is then used to call up an associateddatabase record 303, providing, for example, a prior history ofinteraction, a user record, or the like. The call waiting queue may bemanaged directly by the telephony server. In this case, since the calleris waiting, variable latencies due to communications with a separatecall management system would generally not interfere with callprocessing, and therefore may be tolerated. In other instances, aninteractive voice response (IVR) system may be employed to gatherinformation from the caller during the wait period.

In some instances, there will be no associated record, or in others, theidentification may be ambiguous or incorrect. For example, a call from aPBX wherein an unambiguous caller extension is not provided outside thenetwork, a call from a pay phone, or the like. Therefore, the identityof the caller is then confirmed using voice or promoted DTMF codes,which may include an account number, transaction identifier, or thelike, based on the single or ambiguous records.

During the identity confirmation process, the caller is also directed toprovide certain details relating to the purpose of the call. Forexample, the maybe directed to “press one for sales, two for service,three for technical support, four for returns, and five for other”. Eachselected choice, for example, could include a further menu, or aninteractive voice response, or an option to record information.

The call-related information is then coded as a call characteristicvector 304. This call characteristic is either generated within, ortransmitted to, the communications server system.

Each agent has a skill profile vector. This vector is developed based onvarious efficiency or productivity criteria. For example, in a salesposition, productivity may be defined as sales volume or gross profitsper call or per call minute, customer loyalty of past customers, orother appropriate metrics. In a service call, efficiency may be definedin terms of minutes per call, customer loyalty after the call, customersatisfaction during the call, successful resolution of the problem, orother metrics. These metrics may be absolute values, or normalized forthe agent population, or both. The skill profile vector is stored in atable, and the profiles, which may be updated dynamically, of availableor soon to be available agents, are accessed from the table (database)305.

Typically, the table 305 is provided or updated by a high level callcenter management system to the communications server system as thestaffing assignments change, for example once or more per shift.Intra-shift management, such as scheduling breaks, may be performed at alow or high level.

The optimization entails analysis of various information, which mayinclude the caller characteristics, the call incident characterization,availability of agents, the agent profile(s), and/or various routingprinciples. According to the present invention, the necessaryinformation is made directly available to the communications server,which performs an optimization to determine a “best” target, e.g., agentselection, for the caller.

For example, if peak instantaneous efficiency is desired, for examplewhen the call center is near capacity 306, more advanced optimizationsmay be bypassed and a traditional skill based call routing algorithm 307implemented, which optimizes a short term cost-utility function of thecall center 308. An agent who can “optimally” handle the call is thenselected 309, and the call routed to that agent 310. The global (e.g.,call center) factors may be accounted as a separate set of parameters.

Thus, in order to immediately optimize the call routing, the generalprinciple is to route the call such that the sum of the utilityfunctions of the calls be maximized while the cost of handling thosecalls be minimized. Other types of optimizations may, of course, beapplied.

According to one optional aspect of the invention, the various routingprinciples discussed above explicitly value training as a utility ofhandling a call 311, and thus a long-term optimization is implemented312. The utility of caller satisfaction is also weighted, and thus theagent selected is generally minimally capable of handling the call.Thus, while the caller may be somewhat burdened by assignment to atrainee agent, the call center utility is maximized over the long term,and call center agents will generally increase in skill rapidly.

In order for the communications server system to be able to includethese advanced factors, they must be expressed in a normalized format,such as a cost factor.

As for the cost side of the optimization, the cost of running a callcenter generally is dependent on required shift staffing, since othercosts are generally constant. Accordingly, a preferred type of trainingalgorithm serves to minimize sub-locally optimal call routing duringpeak load periods, and thus would be expected to have no worse costperformance than traditional call centers. However, as the call centerload is reduced, the call routing algorithm routes calls to traineeagents with respect to the call characteristics. This poses two costs.First, since the trainee is less skilled than a fully trained agent, theutility of the call will be reduced. Second, call center agent traininggenerally requires a trainer be available to monitor and coach thetrainee. While the trainer may be an active call center agent, andtherefore part of the fixed overhead, there will be a marginal costsince the trainer agent might be assuming other responsibilities insteadof training. For example, agents not consumed with inbound call handlingmay engage in outbound call campaigns.

It is clearly apparent that the communications server system will havedirect access to call center load data, both in terms of availability ofagents and queue parameters.

Thus, in a training scheme, an optimization is performed, using as atleast one factor the value of training an agent with respect to thatcall 312, and an appropriate trainee agent selected 313.

In order to provide proper training, the trainer and trainee must bothbe available, and the call routed to both 314. Generally, the traineehas primary responsibility for the call, and the trainer has no directcommunication with the caller. Therefore, the trainer may join the callafter commencement, or leave before closing. However, routing a callwhich requires two agents to be simultaneously available poses somedifficulties. In general, the trainer is an agent capable of handlingthe entire call alone, while the trainee may not be. Therefore, thetrainer is a more important participant, and the initial principle inrouting the training call is to ensure that a trainer is available. Thetrainer may then await availability of an appropriate trainee, or ifnone is imminently available, handle the call himself or herself.

On the other hand, where a specific training campaign is in place, and ahigh utility associated with agent training, then the availability of aspecific trainee or class of trainees for a call having definedcharacteristics is particularly important. In that case, when anappropriate trainee is available, the call held in that agent's cue, andthe call possibly commenced, awaiting a training agent's availability.

If the training is highly structured, it is also possible to assign thetrainer and trainee agents in pairs, so that the two are alwaysavailable for calls together.

The system according top the present invention may also providereinforcement for various training. Thus, if a subset of agents receiveclassroom training on a topic, the server may target those agents withcalls relating to that topic. For example, the topic may represent aparameter of a call characterization vector. In order to target certainagents for calls having particular characteristics, a negative cost maybe applied, thus increasing the probability that the agent will beselected, as compared with an agent having a positive cost. By using asingle cost function, rather than specific override, the system becomesresilient, since this allocation is not treated as an exception, andtherefore other parameters may be simultaneously evaluated. For example,if a caller must communicate in a foreign language, and the agent doesnot speak that foreign language, then the system would not target thecall to that agent, even if other factors weigh in favor of suchtargeting.

The same techniques are available for outbound campaigns and/or mixedcall centers. In this case, the cost of training is more pronounced,since agents idle for inbound tasks are generally assigned to outboundtasks, and thus the allocation of trainer agents and trainee agentsgenerally results in both longer call duration and double the number ofagents assigned per call. This cost may again be balanced by avoidingtraining during peak utility outbound calling hours and peak inboundcalling hours; however, training opportunities should not be avoidedabsolutely.

According to one embodiment of the invention, at the conclusion of acall, the caller is prompted through an IVR to immediately assess theinteraction, allowing a subjective scoring of the interaction by thecaller without delay. This information can then be used to update thestored profile parameters for both caller and agent, as well as toprovide feedback to the agent and/or trainer. Under some circumstances,this may also allow immediate rectification of an unsatisfactory result.

As shown in FIG. 3, a communications control system is shown comprisingan input 502 receiving call classification information, the callclassification information comprising a plurality of classificationcharacteristics 501, a data structure 503 representing a plurality ofdistinct agent characteristics 504 for each of a plurality of agents;and a processor 509 a, 509 b, which may include a plurality of centralprocessing units, for: (i) determining, with respect to the receivedcall classification information, an optimum agent 515 a, 515 b, 515 c,515 d, selected from sufficiently capable available agents forassociation with a call corresponding to call classificationinformation, the determination of an optimum agent being based on amultifactorial optimization of (a) at least a non-binary weightedcorrespondence of said plurality of classification characteristics and(b) said plurality of distinct agent characteristics 504 for each ofsaid plurality of agents 515 a, 515 b, 515 c, 515 d, and (ii)controlling a routing of a plurality of concurrent calls with a callrouter 512 in dependence on the determination. The processor may operateunder control of a consolidated operating system 510. The determinationand control by the processor may employ a common message queue 511 inthe operating system 510. The process may maintain a data structure 503representing skill weights 506 with respect to said call classificationinformation 501, and applies said weights to determine an optimum agentselection. The processor may receives extrinsic perturbation information508 independent of the plurality of classification characteristics andthe plurality of distinct agent characteristics, to providediscrimination in control of call routing. A cost function may beprovided for each agent 515 a, 515 b, 515 c, 515 d, the processoroptimizing a cost-benefit outcome of a routing.

A plurality of call classification vectors 501 may be received, theprocessor being adapted to determine, with respect to the receivedplurality of call classification vectors 501, an optimum association ofthe set of agents 15 a, 515 b, 15 c, 515 d, and calls having theassociated call classification vectors 501. As shown in FIG. 4, acommunications method is shown comprising: (a) receiving a plurality ofconcurrent communications, each having a plurality of associatedclassification factors 601; (b) storing information representingcharacteristics of a plurality of potential targets; (c) performing amultifactorial optimization to determine an optimum target for each ofthe plurality of concurrent communications based on the classificationfactors and the characteristics of the plurality of targets 602; and (d)routing at least one of the communications to a respective an optimumtarget, said performing step and said routing step being performed undercontrol of a single computer operating system 605.

The performing and routing may employ a common message queue in anoperating system 607. A data structure representing skill weights withrespect to the communication classification factors is applied todetermine an optimum agent selection 604. The method may also includethe step of perturbing the determining step to provide discrimination inrouting 606. The determining step may comprise providing a cost functionfor each target, and optimizing a cost-benefit outcome of a routing 608.

FIG. 4 shows a communications control system 701, comprising at leastone programmable processor 702 executing instructions stored in acomputer readable medium 703, the instructions being adapted to controlthe at least one programmable processor to execute: (a) a multithreadedoperating system, providing support for applications and for passingmessages between concurrently executing applications 703; (b) acommunications control server application executing under saidmultithreaded operating system, for controlling concurrent real timecommunications 704; and (c) at least one dynamically linkableapplication, executing under said multithreaded operating system,communicating with said communications control server application toreceive call characteristic data and perform a multifactorialoptimization with respect to a plurality of target characteristics foreach of a plurality of available communications targets, to resolve a anoptimal communications target and transmit a resolved communicationstarget, said communications control server application controlling aplurality of concurrent real time communications in dependence on thetransmitted resolved communications target 706.

As shown in FIG. 6, a communications matching system 801 is shown,comprising: (a) a plurality of communications channels for concurrentlycommunicating with a plurality of entities 802; and (b) a communicationsrouter for defining a plurality of concurrent communications pathsbetween sets comprising at least two of said entities, wherein saidcommunications router conducts series of auctions to select respectivecommunications paths from among a plurality of available competingpaths, wherein said series of auctions determine winners based on avaluation function which is sensitive to both economic factors andnon-economic factors, wherein the non-economic factors have an effect onauction outcome which changes over time, the non-economic factors beingvalued at the time of the auction 803.

As shown in FIG. 7, a communications method is shown, comprising thesteps of: (a) providing a plurality of communications channels forconcurrently communicating with a plurality of entities 901; and (b)automatically concurrently routing communications between a plurality ofcommunications channels based on the results of an automated auctionwhich determines at least one winner based on a valuation function whichis sensitive to both economic factors and non-economic factors 902,wherein the non-economic factors have an effect on auction outcome whichchanges over time, the non-economic factors being valued at the time ofthe auction.

The communications channels may be of a first type and a second type,the communications being routed between a user of at least one of afirst type of communications channel and a user of at least one of asecond type of communications channel 903. The non-economic factors maycomprise an optimality of matching a profile representing a user of acommunications channel of the first type with a profile of a user of acommunications channel of a second type 904.

The economic factors may compensate for a suboptimiality of a matchingof profiles to perturb a non-economic optimal matching from the auction905.

As shown n FIG. 8, a communications control method is shown, comprisingthe steps of: (a) receiving call classification information for each ofa plurality of calls, the call classification information comprising aplurality of classification characteristics 1001; (b) representing aplurality of agent characteristics for each of a plurality of agents1002; (c) determining, with respect to the received call classificationinformation associated with a plurality of concurrent calls, an optimumset of concurrent mutually exclusive associations of the set of agentswith the plurality of calls, the determining being dependent on at leasta multifactorial optimization of (i) the weighted correspondence of theplurality of classification characteristics for each of the respectiveplurality of calls, and (ii) the plurality of agent characteristics foreach of said plurality of agents 1003; and (d) controlling a concurrentcall routing of the plurality of calls in dependence on thedetermination 1004.

EXAMPLE 1

Each agent is classified with respect to 10 skills, and each skill canhave a weight of 0 to 127. The skill weights may be entered manually bya supervisor, developed adaptively, or provided by other means. Theseare sent as a parameter file to the communications server.

A rule vector specifies a normalized contribution of each skill to applyto the total. This rule vector, for example, represents the callcharacteristic vector. Thus, attributes of the call and the status ofthe system are analyzed to generate this rule vector. There can be morethan one rule vector defined in a project (split), or a rule can besetup in a per call basis. Generally, routing with predefined rules ismuch more efficient than routing with rules in a per call bases. When acall needs to be routed to an agent, the rule vector is applied to theskills of the available agents and a score is derived for each agent.The agent with the highest score is assigned the call, as shown in Table1.

As shown in Table 1, Agent 1 would be selected, since this is thehighest score.

In this example, it is presumed that all selections have the same cost,and therefore the utility only varies. Thus, the agent with the highestutility function is the optimal selection.

EXAMPLE 2

The conditions below are the same as in Example 1, except two newfactors are provided, Ac1 and Ac2. The Preliminary Score is calculatedas the sum of the products of the Rule Vector and the Agent Vector. TheFinal Score is calculated as (Ac1×sum)+AC2.

In this case, Ac1 represents an agent-skill weighting cost function,while Ac2 represents an agent cost function. Since we select the maximumvalue, more expensive agents have correspondingly lower cost values.

As can be seen in Table 2, Agent 5 is now optimum.

EXAMPLE 3

In this example, a limiting criterion is imposed, that is, only agentswith a skill score within a bound are eligible for selection. While thismay be implemented in a number of ways, possibly the simplest is todefine the range, which will typically be a lower skill limit only,below which an agent is excluded from selection, as a preliminary testfor “availability”.

As noted below in Table 3, the screening criteria may be lower, upper orrange limits. In this case, the screening process excludes agents 2, 3,and 5, leaving agents 1 and 4 available. Of these two choices, agent 1has the higher score and would be targeted. (Note: 2, 3, 5 excluded, 1,4 available).

EXAMPLE 4

In this example, the optimization seeks to optimize the placement of 5incoming calls to 5 agents. As shown in Table 4, each caller isrepresented by a different call vector, and each agent by a distinctskill vector. The optimization therefore seeks the maximum utility fromthe respective possible pairings.

Table 1 Agent Agent Agent Agent Agent Rule vector 1 2 3 4 5 20%  Skill 120 5 3 5 4 5% Skill 2 3 3 3 3 3 10%  Skill 3 10 6 9 10 10 15%  Skill 443 50 33 46 25 3% Skill 5 7 2 9 2 8 7% Skill 6 5 8 5 8 9 20%  Skill 7 23 4 2 2 8% Skill 8 64 80 29 45 77 5% Skill 9 4 5 4 1 2 7% Skill 10 9 3 83 6 100%   Score 18.51 17.33 11.1 13.93 13.65

TABLE 2 Agent Agent Agent Agent Agent Rule Vector 1 2 3 4 5 Ac1 0.4 0.550.45 0.7 0.6 Ac2 6 3 6.8 2 5.5  20% Skill 1 20 5 3 5 4   5% Skill 2 3 33 3 3  10% Skill 3 10 6 9 10 10  15% Skill 4 43 50 33 46 25   3% Skill 57 2 9 2 8   7% Skill 6 5 8 5 8 9  20% Skill 7 2 3 4 2 2   8% Skill 8 6480 29 45 77   5% Skill 9 4 5 4 1 2   7% Skill 10 9 3 8 3 6 100% Prelim18.51 17.33 11.1 13.93 13.65 Score Final 13.40 12.53 11.80 11.75 13.69Score

TABLE 3 Rule Vector Min Max Exclude Agent Agent Agent Agent Agent SkillSkill Agent 1 2 3 4 5 Ac1 0.4 0.55 0.45 0.7 0.6 Ac2 6 3 6.8 2 5.5 20% 0% 25% Skill 1 20 5 3 5 4  5% Skill 2 3 3 3 3 3 10% Skill 3 10 6 9 1010 15% 40% 100%  3, 5 Skill 4 43 50 33 46 25  3% Skill 5 7 2 9 2 8  7%Skill 6 5 8 5 8 9 20% Skill 7 2 3 4 2 2  8% 30% 75% 2, 3, 5 Skill 8 6480 29 45 77  5% Skill 9 4 5 4 1 2  7% Skill 10 9 3 8 3 6 100%  Pre-Score18.51 17.33 11.1 13.93 13.65 Final Score 13.40 12.53 11.80 11.75 13.69

TABLE 4 Rule Rule Rule Rule Rule Vector Vector Vector Vector VectorAgent Agent Agent Agent Agent SKILL 1 2 3 4 5 1 2 3 4 5 1 20% 25% 17%20% 14% 20 5 3 5 4 2  5% 10%  5%  5%  3% 3 3 3 3 3 3 10% 15% 20% 10%  8%10 6 9 10 10 4 15% 10%  5%  5%  5% 43 50 33 46 25 5  3%  0%  5%  8%  1%7 2 9 2 8 6  7% 10% 13% 10%  7% 5 8 5 8 9 7 20% 10%  5% 10% 20% 2 3 4 22 8  8%  4%  8%  4%  8% 64 80 29 45 77 9  5%  8% 13% 18% 23% 4 5 4 1 210  7%  8%  9% 10% 11% 9 3 8 3 6 100%  100%  100%  100%  100%  Rule 118.51 17.33 11.1 13.93 13.65 Rule 2 15.4 12.39 8.72 10.77 10.12 Rule 315.25 13.31 8.97 10.54 12.71 Rule 4 12.74 9.91 7.6 7.89 8.98 Rule 513.69 12.83 8.24 9.03 11.09

TABLE 6 Rule Rule Rule Rule Rule Agent Agent Agent Agent Agent SKILLVector 1 Vector 2 Vector 3 Vector 4 Vector 5 1 2 3 4 5 Caller 3 3.5 2.754 10 time factor Agent 0.59 0.68 1 0.86 0.79 Cost Agent 1.3 1.3 1 1.11.2 time factor 1 20% 25% 17% 20% 14% 20 5 3 5 4 2  5% 10%  5%  5%  3% 33 3 3 3 3 10% 15% 20% 10%  8% 10 6 9 10 10 4 15% 10%  5%  5%  5% 43 5033 46 25 5  3%  0%  5%  8%  1% 7 2 9 2 8 6  7% 10% 13% 10%  7% 5 8 5 8 97 20% 10%  5% 10% 20% 2 3 4 2 2 8  8%  4%  8%  4%  8% 64 80 29 45 77 9 5%  8% 13% 18% 23% 4 5 4 1 2 10  7%  8%  9% 10% 11% 9 3 8 3 6 100% 100%  100%  100%  100%  Rule 1 72.189 58.80069 19.647 31.71861 36.855Rule 2 70.07 49.045815 18.0068 28.610505 31.878 Rule 3 54.5187541.3974275 14.553825 21.999615 31.45725 Rule 4 66.248 44.83284 17.93623.95404 32.328 Rule 5 177.97 145.1073 48.616 68.5377 99.81

TABLE 5 Combinatorial analysis of agents vs. callers 58.85 59.52 58.7759.58 60.68 58.79 58.04 58.85 60.28 57.72 58.12 58.93 60.42 57.86 59.0160.15 59.26 56.7 59.96 58.18 57.88 58.55 58.88 60.66 59.71 57.82 58.1559.93 59.31 56.75 55.41 57.19 60.53 57.97 56.3 57.33 60.34 57.78 57.2555.36 60.13 61.28 59.25 60.06 61.96 61.33 59.3 60.11 62.04 60.26 58.959.71 60.9 59.12 59.79 60.93 59.74 57.96 58.63 58.96 60.24 49.54 56.5458.32 62.07 58.99 56.96 58.74 59.33 57.92 56.56 58.34 58.19 56.78 57.4558.48 58 56.59 57.26 56.51 58.66 59.81 60.14 62.42 60.49 59.86 60.1962.47 60.57 58.79 57.45 59.73 61.79 60.01 58.34 58.59 62.1 60.32 58.6556.62 59.74 58.07 57.32 59.6 61.57 58.49 57.74 60.02 58.83 57.42 57.8260.1 58.97 57.56 58.71 58.96 59.28 57.87 59.02 56.99

TABLE 7 Combinatorial Analysis 259.55 255.35 256.83 289.63 267.18 254.87256.35 289.15 255.09 246.97 247.41 280.21 236.65 232.45 235.02 290.71244.29 231.98 234.54 290.23 232.19 224.07 219.41 275.10 260.98 259.94259.99 292.78 268.61 260.93 260.98 293.77 259.67 253.02 248.88 281.67239.16 163.40 231.99 287.68 246.80 234.79 234.84 290.54 231.67 226.89222.75 278.44 224.17 223.14 225.70 295.30 231.81 224.13 226.69 296.28222.87 216.22 211.56 281.15 225.26 218.03 219.51 289.10 232.89 220.89222.37 291.96 217.76 212.98 213.43 283.02 264.86 256.75 255.71 291.07309.10 300.99 367.43 302.51 243.05 234.93 227.70 284.87 310.18 302.07339.43 296.32 268.02 261.37 257.18 292.53 312.26 305.61 301.42 303.98240.01 235.24 231.04 288.21 307.15 302.37 298.18 299.66 233.73 227.08219.85 289.50 314.77 308.12 300.9 300.95 227.54 222.76 221.72 291.37308.58 303.80 302.76 302.82

Using a combinatorial analysis, as shown in Table 5, the maximum valueis 62.42, which represents the selection of agent 1/caller 1; agent2/caller 5; agent 3/caller 4; agent 4, caller 2; and agent 5, caller 3.

EXAMPLE 5

Similarly to Example 4, it is also possible to include an agent costanalysis, to provide an optimum cost-utility function. As in Example 2,the cost factors are reciprocal, since we select the largest value asthe optimum. Likewise, time factors are also reciprocal, since we seekto minimize the time spent per call. In this case, shown in Table 6, thecost analysis employs three additional parameters: the agent cost, avalue representing the cost of the agent per unit time; a valuerepresenting an anticipated duration of the call based on thecharacteristics of the caller; and a value representing the anticipatedduration of the call based on characteristics of the agent.

As can be seen in Table 7, the maximum value is 314.78, whichcorresponds to a selection of:

-   -   Agent 1/Call 5; Agent 2/Call 1; Agent 3/Call 4; Agent 4/Call 2;        and Agent 5/Call 3.

Therefore, it is seen that the optimum agent/caller selection issensitive to these cost factors.

It is also seen that, while the analysis can become quite complex, theformulae may be limited to evaluation of simple arithmetic functions,principally addition and multiplication, with few divisions required.Thus, these calculations may be executed efficiently in a generalpurpose computing environment.

EXAMPLE 6

Geographic information may be used as a basis for communicationsrouting. Mobile phones are or will be capable of geolocation, meaningthat the location of the handset may be automatically determined in realtime and communicated. Likewise, a location of landlines can typicallybe determined. There are a number of instances where this informationmay then advantageously be used to route calls. For example, a call to anational pizza delivery chain toll free number or central facility maybe automatically routed to a geographically proximate local franchisee,or, if a number are available, to one of a qualified group. It is notedthat while the communications are preferably voice communications, othertype of communications may be supported.

However, it is also possible to perform evaluation of more complexalgorithms in order to determine a set of communications partners. Forexample, a geographic factor, a past history, and/or user profile may beavailable to describe the caller. This information may provide, forexample, a preferred language, a contact report (identifying likelyissues), demographic information, and user personality (as determinedfrom a prior communication). Likewise, an interactive voice or keypadresponse system can glean further information to determine the issuesinvolved in the call. Using this information, a vector may be provideddescribing the caller and the likely issues of the call, which may thenbe used to optimize a targeting of the call to available recipients. Themaintenance of vectors to describe available call targets is describedabove.

In cases where multiple recipients are available and have, within areasonable range, equivalent or super-threshold qualifications orsuitability to receive the call, it may be appropriate for the potentialrecipients to compete for the call. That is, the optimization oftargeting (e.g., pairing of a caller and callee) includes an economiccomponent, optionally with a non-economic component. For example, thepotential recipients each submit a bid for the call, with the call beingrouted to the auction winner (which may be a payment to or from therecipient, depending on the circumstances of the auction) at, forexample, a first or second price, according to the auction rules.

In a typical case, the routing server has a direct and prearrangedfinancial arrangement with the bidders, and the auction process does notdirectly involve the caller. On the other hand, other cases allow thecaller to be involved in the auction as a “buyer” or “seller”, with thecommunications router serving only in the capacity of auctioneer, andnot a principal to the auction.

In cases where the potential recipients do not all have equivalentqualifications, a normalization function may be applied to correct thebids. For example, a potential recipient with a 60% match with therequired qualification profile might have to bid 50% more than apotential recipient with a 90% match, assuming that the matchingfunction linearly corresponds with an economic factor; otherwise, anon-linear normalization may be applied. This is equivalent to providingthat the value applied to determine the auction winner includes acomponent representing an economic value and a component representing anon-economic value, e.g., a match or optimality score for the call,which is determined for each bidder to determine the winner. The bidderin this case may either have knowledge of the match score, or may bidblind.

In a commission based system, for example, an agent with a higher salesaverage performance might have to bid a lower amount than an agent withlower performance, the difference being an amount which tends toequalize (but not necessarily completely equalize) the anticipatedpayoff from the call, thus incentivizing higher sales performance. Inany case, the communications router (or a separate system whichcommunicates with the communications router in some embodiments)evaluates the bids including both economic and non-economic components,determines the winning bidder, and determines the communicationspath(s).

In another embodiment, a group of agents within a call center haveperformance goals for a shift, with possible gradation between agents ofthe goals based on compensation, seniority, etc. The agents are within aqueue, in which the default is a sequential selection of availableagents. However, an agent may seek to take a break, and therefore bidsfor a lower position within the queue. Likewise, an agent may find himor herself behind in performance, and wish to bid for higher placementwithin the queue. As discussed above, the bid cost or perturbationeffect may be normalized based on a variety of factors and schemes,including the optimality of matching. In this scheme, the auction may beeconomic or non-economic. In a non-economic scheme, each agent isprovided with a set of bid units, for example 100 per shift The bidunits may then be applied to advance within the queue, or even tradedwith another agent (although this possibility leaves open the issue ofundesired indirect real economic effects, since the trade may involveextrinsic value).

Another possibility is the ad hoc formation of chat groups. In thiscase, the composition of the group is optimized based on the respectiveprofile vectors of the members. In some cases, the ideal or optimum isminimum variance of the vectors, but in other cases optimality mayrequire complementary components. Assuming multiple chat groups andmultiple callers, there may be a market economy for matching a callerwith a group. In such a scenario, a VCG type auction may be conducted,with the composition of each group allocated based on an optimization ofbid values. An example of this is a sports chat line. A number of fansand sports celebrities contact a call center and are identified and aprofile applied. Using market principles, the groups are formed tomaximize the utility aggregate functions. Thus, a group of “highrollers” may gain the benefit of a superstar, while neophytes may onlycommunicate with a rookie, with the set of groups optimized to achievemaximum utility.

An automated chat system may also be used for dating services, adulttheme entertainment, business services, consumer services, or the like.In these systems, the communications router typically taxes some of theeconomic surplus generated by the system, in a real economic form, whilebenefiting the various classes of user.

It is noted that the auction may involve transfer of real economicbenefits, or a synthetic economy constructed within a closed system. Forexample, micropayment technologies may be employed to authorize andconvey the value between entities, even through an open network, withouthaving to trust all entities within the chain of custody.

The bidding may be a volitional real time event, allowing those involvedto make decisions on the spot; but more typically, a bidder will definea personal value function, which is then used in an automated auctionprocess. The bidder will therefore provide an indirect control over thebidding on his or her behalf, for example using feedback to tune theattributed value function to a desired value. In auction types wherebroadcast of a true value is a dominant strategy, the function itselfmay be presented as a bid (assuming that the auctioneer has sufficientinformation to evaluate the function), otherwise, it may be evaluatedunder the circumstances and a normalized value transmitted. Theauctioneer is, in this case, the communications arbitrator or switch. Ina successive price auction, the value function itself is preserved,although the dropout pattern may be noted, allowing an estimation of thevalue function of competitors.

It should be clear that there are many possible scenarios which allowcallers and/or potential recipients to compete for a connection, andtherefore a large variety of auction types may be implementedaccordingly.

The present system differs from a known telecommunications auction inthat, for example, it is sensitive to user characteristics, and does nottreat each communications line as a simple commodity.

From the above description and drawings, it will be understood by thoseof ordinary skill in the art that the particular embodiments shown anddescribed are for purposes of illustration only and are not intended tolimit the scope of the invention. Those of ordinary skill in the artwill recognize that the invention may be embodied in other specificforms without departing from its spirit or essential characteristics.References to details of particular embodiments are not intended tolimit the scope of the claims.

It should be appreciated by those skilled in the art that the specificembodiments disclosed above may be readily utilized as a basis formodifying or designing other structures for carrying out the samepurposes of the present invention. It should also be realized by thoseskilled in the art that such equivalent constructions do not depart fromthe spirit and scope of the invention as set forth in the appendedclaims.

What is claimed is:
 1. A method for matching a first subset selectedfrom a plurality of first entities with a second subset selected from aplurality of second entities, comprising: storing in a memory aplurality of multivalued scalar data representing inferential targetingparameters for the first subset; storing in the memory a plurality ofmultivalued scalar data of each of the plurality of second entities,representing respective characteristic parameters for each respectivesecond entity; performing, using an automated processor, an optimizationwith respect to at least an economic surplus of a respective mutuallyexclusive match of the first subset with the second subset, and anopportunity cost of the unavailability of the second subset for matchingwith an alternate subset of the plurality of first entities; andoutputting a signal in dependence on the optimization.
 2. The methodaccording to claim 1, wherein the first subset has a cost of a match anda benefit of a match, and the plurality of second entities each have acost of a match, and a benefit of a match, the optimization beingresponsive to both the cost and benefit for each member of the firstsubset and the second subset.
 3. The method according to claim 1,wherein the match is used to establish a real time communication linkbetween the first subset and the second subset.
 4. The method accordingto claim 1, further comprising: storing in a memory a plurality ofmultivalued scalar data representing inferential targeting parametersfor a third subset of the plurality of first entities; performing usingan automated processor, the optimization further with respect to aneconomic surplus of a respective match of the third subset with a fourthsubset of the second entities, and an opportunity cost of theunavailability of the fourth subset for matching with an alternatesubset of the plurality of first entities, wherein membership in thesecond and fourth subsets is mutually exclusive; and outputting a signalin dependence on the second optimization.
 5. The method according toclaim 1, wherein the plurality of multivalued scalar data representinginferential targeting parameters of the first entities comprisecharacteristics of an information requirement, and the plurality ofmultivalued scalar data representing inferential targeting parameters ofthe second entities comprise characteristics an informationavailability, wherein the match defines a communication routing.
 6. Themethod according to claim 1, wherein the optimization comprises aneconomic optimization attributing a non-trivial economic value to eachof the plurality of multivalued scalar data representing inferentialtargeting parameters for first entities and the second entities, adaptedto maximize a predicted aggregate economic surplus value dependent on arouting over a period of time of a plurality of concurrentcommunications each having a respective economic surplus value.
 7. Themethod according to claim 1, wherein the plurality of second entitiescomprise agents of at least one call center.
 8. The method according toclaim 1, wherein the automated processor accesses the memory storing theplurality of multivalued scalar data of each of the plurality of secondentities to retrieve a data structure representing a plurality of skillweights for each of a plurality of agents, the optimization beingconducted according to an algorithm adapted to predict an efficiency ofa respective agent with respect to the prospective match with the firstsubset normalized by a respective cost of the respective agent.
 9. Themethod according to claim 1, wherein the automated processor executesunder control of a software operating system having a message queue,wherein the automated processor communicates with a communication routercontrolled by the automated processor under the control of the operatingsystem responsive to the signal via messages passed through the messagequeue.
 10. The method according to claim 1, wherein the optimizationfurther receives an extrinsic perturbation independent of the storedplurality of multivalued scalar data of each of the first subset andplurality of second entities, to provide discrimination in control ofthe matching.
 11. A method for matching a first entity with a secondentity, comprising: storing a plurality of multivalued scalar datarepresenting inferential targeting parameters for the first entity;storing a plurality of multivalued scalar data of each of the pluralityof second entities, representing inferential targeting parameters for aplurality of second entities; performing using an automated processor,based on at least the stored plurality of multivalue scalar data, aneconomic optimization seeking to maximize a normalized economic surplusof a respective mutually exclusive match of the first entity with thesecond entity, in conjunction with an opportunity cost of theunavailability of the second entity as a result of the match; andoutputting a signal in dependence on the optimization.
 12. The methodaccording to claim 11, wherein the signal is used to control a routingof a communication wherein the routing is not explicitly defined by aninitiator of the communication, the plurality of multivalued scalar dataeach being a non-trivial economic value associated with a plurality ofcharacteristics of the first entity and the plurality of secondentities.
 13. The method according to claim 11, wherein the automatedprocessor predicts, as a part of the optimization, a duration of thecommunication and a set of competing matches for the plurality of secondentities.
 14. The method according to claim 11, wherein a plurality offirst entities are concurrently and mutually exclusively matched withrespective second entities.
 15. The method according to claim 11,wherein the match is used to control a real time communication.
 16. Themethod according to claim 11, wherein the plurality of multivaluedscalar data of the second entities comprises a plurality of skillweights for each of a plurality of agents, the optimization furthercomprising predicting both an efficiency and a cost of a respectiveagent with respect to a match with the first entity.
 17. The methodaccording to claim 11, wherein the optimization economically optimizesan efficiency and a cost of a respective agent with respect to a matchwith the first entity, and the economic benefit as a result of thematch, with respect to alternate matches of the first and second entity,and competing matches of different first entities with the respectivesecond entity.
 18. The method according to claim 11, wherein signalcomprises at least one message passed through a message queue of acomputer operating system, which is communicated to a communicationrouter operating under the operating system for control over a routingof a communication.
 19. The method according to claim 11, furthercomprising receiving an extrinsic perturbation independent of theplurality of multivalued scalar data, the optimization being performedat least in dependence on the extrinsic perturbation, to providediscrimination the matching of the first entity and the second entity.20. A method for matching a first subset of first entities having aplurality of members with a second subset of second entities having aplurality of members, comprising: storing in a first memory location aplurality of multivalued scalar data representing inferential targetingparameters for at least the first subset; storing in a second memorylocation a plurality of multivalued scalar data representingcharacteristic parameters for at least the second subset; performing,using an automated processor, an optimization, to select a mutuallyexclusive matching of respective members of the first subset withmembers of the second subset which imposes an opportunity cost on atleast the respective members of the first or second subset, whichmaximizes an economic surplus with respect to a plurality of alternatematchings of the members of the first subset with the members of thesecond subset, to thereby account for the opportunity cost; andoutputting a signal representing the selected matching in dependence onthe optimization.